On 2/3/2024 5:17 PM, Physfitfreak wrote:
> On 2/3/2024 10:19 AM, Farley Flud wrote:
>> On Sat, 3 Feb 2024 04:00:30 -0600, Physfitfreak wrote:
>>
>>>
>>> Thus the story continues...
>>>
>>> How many gold coins should Holaku Khan take with him to his parties?
>>>
>>
>> I'll pass.  I don't know how to play chess.  I think that, like all
>> games, chess is stupid and boring.

It's actually thrilling and challenging. It's a real downer to lose,
though.

The former cola "advocate" Branimir Maksimovic is a chess International
Master.

>> It reminds of the time I enrolled in a computer science class at
>> the university.  Our very first assignment was to write a program
>> that kept score of a bowling game.
>>
>> Bowling?  I don't fucking know how to bowl.  I never fucking went
>> bowing in my entire fucking life.
>>
>> So now I first gotta learn the rules of the game of bowling and
>> then write the program.  I said: "Fuck that!"  I just dropped the
>> course.  I'll enroll with an instructor who is progressive and sane.
>>
>
>
> Hahhahah :) Makes sense.

It makes sense to you to drop a class rather than spend 10 minutes
learning how bowling scores are calculated? It was Feeb chickening out
and running away.

> I used the chess game in this story cause it is a much, much more
> universal pastime, and very ancient. So ancient that terms associated
> with it in German and Persian are almost the same! It goes that far back.
>
> And I used only the movement types of its pieces, and nothing else. No
> other rules whatsoever.

Incorrect. You also stipulated random pieces placed randomly on the
board, making your problem invalid.

> And I assumed everybody knows that chessboard is
> an 8 squares by 8 squares board, consisting of 64 squares on which these
> pieces can move in their own ways if not blocked by another piece.
>
> This story gives an opportunity - for the code monkeys really - to try
> their use of loops within loops to solve clear but involved logical
> situations. Several arrays are involved.

You can throw a million "real programmers" at it - as you worded it, the
problem is unsolvable.

> I intended to later add one more piece to the two! :-) And then one
> more, and then one more... Then one would get very close to do what
> computer chess developers do.

Chess game developers start with known pieces at known starting
positions. Your weird problem started with random pieces at random
positions.

> But if it has to stop in this forum, before even it started, then so be it.

?

> But I still challenge everybody in this forum other than Farley, to
> salvage their fucked up images as "programmers", by writing the baby
> program that solves this problem in its most simple form, which is two
> chess pieces.

Which two? Where are they positioned? Can one piece block the other?

> It is simple enough to be done by any code monkey, and yet
> involved enough to be too time-consuming to do it "by hand".

When is your "solution" coming?

On 2/3/2024 10:40 PM, DFS wrote:
> On 1/31/2024 6:33 PM, Physfitfreak wrote:
>
>
>> "Each integer is made of three non-repeating digits and when you
>> divide the integers by the products of their own digits they give
>> exactly the month and the day of birthday of Holaku's beautiful
>> daughter, respectively! :)"
>> ...
>> Tusi right away gave him two other three-digit numbers that had
>> exactly the same properties!
>>
>> What was the date of Holaku's daughter's birthday?
>
>
>> can you show a computer program to do solve the proposed problem?
>
> Of course.
>
> ===================================================================
> nbr,prod,div = 0,0,0.0
> daymth = [0] * 31
>
> for i in range(1,10):
>     for j in range(1,10):
>         for k in range(1,10):
>             if (j!=i and k!=i and k!=j):
>                 nbr = int(str(i) + str(j) + str(k))
>                 prod = i * j * k;
>                 div = nbr / prod
>                 if nbr % prod == 0:
>                     if div >= 1 and div <= 31:
>                         daymth[int(div)-1] += 1
>
> for i in range(1,32):
>     if daymth[i-1] > 1:
>         if i > 12:
>             print("Birth day   = %d" % (i))
>         else:
>             print("Birth month = %d" % (i))
> ===================================================================
>
> $python age.py
> Birth month = 8
> Birth day   = 18
>
>
>
> Notice Feeb refused to show his code. That's not an oversight - he's
> afraid for others to see it.
>
>

I don't know Python. Write the code in BASIC so I can verify it. And do
not use AI to write the code for you.

On 2/4/2024 12:33 AM, Physfitfreak wrote:
> On 2/3/2024 10:40 PM, DFS wrote:
>> On 1/31/2024 6:33 PM, Physfitfreak wrote:
>>
>>
>>> "Each integer is made of three non-repeating digits and when you
>>> divide the integers by the products of their own digits they give
>>> exactly the month and the day of birthday of Holaku's beautiful
>>> daughter, respectively! :)"
>>> ...
>>> Tusi right away gave him two other three-digit numbers that had
>>> exactly the same properties!
>>>
>>> What was the date of Holaku's daughter's birthday?
>>
>>
>>> can you show a computer program to do solve the proposed problem?
>>
>> Of course.
>>
>> ===================================================================
>> nbr,prod,div = 0,0,0.0
>> daymth = [0] * 31
>>
>> for i in range(1,10):
>>      for j in range(1,10):
>>          for k in range(1,10):
>>              if (j!=i and k!=i and k!=j):
>>                  nbr = int(str(i) + str(j) + str(k))
>>                  prod = i * j * k;
>>                  div = nbr / prod
>>                  if nbr % prod == 0:
>>                      if div >= 1 and div <= 31:
>>                          daymth[int(div)-1] += 1
>>
>> for i in range(1,32):
>>      if daymth[i-1] > 1:
>>          if i > 12:
>>              print("Birth day   = %d" % (i))
>>          else:
>>              print("Birth month = %d" % (i))
>> ===================================================================
>>
>> $python age.py
>> Birth month = 8
>> Birth day   = 18
>>
>>
>>
>> Notice Feeb refused to show his code. That's not an oversight - he's
>> afraid for others to see it.
>>
>>
>
>
> I don't know Python. Write the code in BASIC so I can verify it. And do
> not use AI to write the code for you.
>
>

But looks like you've got the gist of it correctly. So never mind.

The fastest way to get to the result is not to code everything, but just
find cases of three digit integers with non-repeating digits, that when
divided by the product of their three digits would result another
integer lower than 32 (i.e. day of the month is within 1 to 31, and
month of the year is within 1 to 12). Then by looking at the output we
can detect which resulting integers were repeated and how many times.

The qbasic code for it is:

For i=1 to 9
for j = 1 to 9
if j<>i then
for k = 1 to 9
if k<>j and k<>i then
dm=(100*i + 10*j + k)/(i*j*k)
if (dm - fix(dm) < 0.00000001) and (dm > 0) and (dm < 32) then
print, i,j,k, "day or month is: ";dm
end if
end if
next k
end if
next J
next i

Which results in an output with the column list of 3 digit integers on
the left, and column for "day or month" numbers on the right. Then by
looking at day or month numbers one can see that only 8 and 18 are
repeated, and repeated twice, and one is less than 13 so the month must
be that one, and the other must then be the day of the month.

Note that since round off error in qbasic is high, instead of the "= 0"
in the if condition, I had to use "< 0.00000001" otherwise even if
correct result of division is an integer, the difference between that
number and the actual integer form of the number (fix(dm)) might not be
zero, but a very small number; in which case I would miss all such result.

So this problem was well-posed after all. The story matched the math :)

Le 03-02-2024, Farley Flud <ff@linux.rocks> a écrit :
> On Sat, 3 Feb 2024 04:00:30 -0600, Physfitfreak wrote:
>>
>> Thus the story continues...
>>
>> How many gold coins should Holaku Khan take with him to his parties?
>
> I'll pass. I don't know how to play chess.

That's easy to believe.

> I think

I don't believe that.

> So now I first gotta learn the rules of the game of bowling and
> then write the program. I said: "Fuck that!" I just dropped the
> course.

I believe you were unable to find the solution on Internet and found an
excuse to drop without confessing the request was beyond you capacities.

--
Si vous avez du temps à perdre :
https://scarpet42.gitlab.io

On 2/4/2024 1:33 AM, Physfitfreak wrote:
> On 2/3/2024 10:40 PM, DFS wrote:
>> On 1/31/2024 6:33 PM, Physfitfreak wrote:
>>
>>
>>> "Each integer is made of three non-repeating digits and when you
>>> divide the integers by the products of their own digits they give
>>> exactly the month and the day of birthday of Holaku's beautiful
>>> daughter, respectively! :)"
>>> ...
>>> Tusi right away gave him two other three-digit numbers that had
>>> exactly the same properties!
>>>
>>> What was the date of Holaku's daughter's birthday?
>>
>>
>>> can you show a computer program to do solve the proposed problem?
>>
>> Of course.
>>
>> ===================================================================
>> nbr,prod,div = 0,0,0.0
>> daymth = [0] * 31
>>
>> for i in range(1,10):
>>      for j in range(1,10):
>>          for k in range(1,10):
>>              if (j!=i and k!=i and k!=j):
>>                  nbr = int(str(i) + str(j) + str(k))
>>                  prod = i * j * k;
>>                  div = nbr / prod
>>                  if nbr % prod == 0:
>>                      if div >= 1 and div <= 31:
>>                          daymth[int(div)-1] += 1
>>
>> for i in range(1,32):
>>      if daymth[i-1] > 1:
>>          if i > 12:
>>              print("Birth day   = %d" % (i))
>>          else:
>>              print("Birth month = %d" % (i))
>> ===================================================================
>>
>> $python age.py
>> Birth month = 8
>> Birth day   = 18
>>
>>
>>
>> Notice Feeb refused to show his code. That's not an oversight - he's
>> afraid for others to see it.
>>
>>
>
>
> I don't know Python.

That's OK. You don't need to know much Python at all to decipher that
little bit. It is important to know Python requires/enforces tab indenting.

* the first line declares and initializes 3 variables (2 ints and a
float). You don't have to specify datatypes in Python. Python
assigns the initial datatype based on the values you first assign to
a variable.
* the second line declares and initializes a length-31 int array
containing all zeroes.
* line 3 is blank
* lines 4,5,6 start nested loops used to build the integers (note they
don't include zeroes - I wrote a version that allowed zeroes in the
integers, and it came back with a bunch of different birthdays.
* line 7 ensures the integers have no repeating digits
* line 8 converts each digit to a string, concatenates them, then
converts that string to a 3-digit integer.
* line 9 calcs the product of the digits
* line 10 divides the 3-digit integer by the product of the digits (I
call the result 'div')
* line 11 calcs a modulo to ensure the 3-digit integer is exactly
divisible by the product of the digits. Those are the only 3-digit
integers we're concerned with.
* line 12 ensures we consider only div values between 1 and 31 (days of
the month) inclusive
* line 13 increments the values in the array declared in line 2. Python
array-addressing is 0-based.
* line 14 is blank
* line 15 starts a loop to examine the counts of div in the array.
Python range(N) by default stops at N-1.
* line 16 looks for div values appearing more than once (given your
specs, I could've said = 2)
* line 17 says values above 12 are to be considered days
* line 18 prints the birth day
* line 19 is an else
* line 20 says value up to 12 are months (this is a weakness, since they
could also be days)

> Write the code in BASIC so I can verify it.

No. But it would look very similar in C and VBA.

I HIGHLY recommend you drop all Basics and start learning Python. It
has some kickass features and builtin functions that can really save
time. It's easy to learn, write and read. It's real slow at certain
things, though.

> And do not use AI to write the code for you.

I would be stunned if AI could actually write such code, or even solve
the problem without code.

On 2/4/2024 2:29 AM, Physfitfreak wrote:

>> I don't know Python. Write the code in BASIC so I can verify it. And
>> do not use AI to write the code for you.
>>
>
> But looks like you've got the gist of it correctly. So never mind.
>
> The fastest way to get to the result is not to code everything, but just
> find cases of three digit integers with non-repeating digits, that when
> divided by the product of their three digits would result another
> integer lower than 32 (i.e. day of the month is within 1 to 31, and
> month of the year is within 1 to 12). Then by looking at the output we
> can detect which resulting integers were repeated and how many times.

No sense in writing partial code - a few more lines and the computer
does everything for you.

> The qbasic code for it is:
>
> For i=1 to 9
>   for j = 1 to 9
>     if j<>i then
>       for k = 1 to 9
>         if k<>j and k<>i then
>           dm=(100*i + 10*j + k)/(i*j*k)
>           if (dm - fix(dm) < 0.00000001) and (dm > 0) and (dm < 32) then
>             print, i,j,k, "day or month is: ";dm
>           end if
>         end if
>       next k
>     end if
>   next J
> next i
>
> Which results in an output with the column list of 3 digit integers on
> the left, and column for "day or month" numbers on the right. Then by
> looking at day or month numbers one can see that only 8 and 18 are
> repeated, and repeated twice, and one is less than 13 so the month must
> be that one, and the other must then be the day of the month.

The computer can suss that better and faster than us.

So do yourself a favor and finish the QBasic code so it identifies the
birthday for you.

> Note that since round off error in qbasic is high, instead of the "= 0"
> in the if condition, I had to use "< 0.00000001" otherwise even if
> correct result of division is an integer, the difference between that
> number and the actual integer form of the number (fix(dm)) might not be
> zero, but a very small number; in which case I would miss all such result.
>
> So this problem was well-posed after all. The story matched the math :)

Is it a Persian thing to dress up simple math problems with long, weird,
elaborate stories, replete with magic mountains and plush carpets and
virginal daughters and princes carrying bags of gold coins?

Or are you high when you post such nutty problems?

On 2/3/2024 11:40 PM, DFS wrote:
> On 1/31/2024 6:33 PM, Physfitfreak wrote:
>> can you show a computer program to do solve the proposed problem?
>
> Of course.
>
> ===================================================================
> nbr,prod,div = 0,0,0.0
> daymth = [0] * 31
>
> for i in range(1,10):
>     for j in range(1,10):
>         for k in range(1,10):
>             if (j!=i and k!=i and k!=j):
>                 nbr = int(str(i) + str(j) + str(k))
>                 prod = i * j * k;
>                 div = nbr / prod
>                 if nbr % prod == 0:
>                     if div >= 1 and div <= 31:
>                         daymth[int(div)-1] += 1
>
> for i in range(1,32):
>     if daymth[i-1] > 1:
>         if i > 12:
>             print("Birth day   = %d" % (i))
>         else:
>             print("Birth month = %d" % (i))
> ===================================================================
>
> $python age.py
> Birth month = 8
> Birth day   = 18

===================================================================
C version
===================================================================
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int main(void) {

int i,j,k,nbr,prod;
char nbrstr[4];
double div;
int daymth[31] = {0};

for (i = 1; i < 10; i++) {
for (j = 1; j < 10; j++) {
for (k = 1; k < 10; k++) {
if (j!=i && k!=i && k!=j) {
sprintf(nbrstr,"%d%d%d", i,j,k);
nbr = atoi(nbrstr);
prod = i*j*k;
div = (double)nbr / (double)prod;
if (nbr % prod == 0) {
if (div >= 1 && div <= 31) {
//printf("Nbr=%d, Product=%d, Div=%.f\n",nbr,prod,div);
daymth[(int)(div)-1] += 1;
}
}
}
}
}
}

for (i=1;i<=31;i++) {
//printf("%d\n", daymth[i-1]);
if (daymth[i-1] > 1) {
if (i > 12)
{printf("Birth day = %d\n", i);}
else
{printf("Birth month = %d\n", i);}
}
}

return(0);
} ===================================================================
$ ./age
Birth month = 8
Birth day = 18

===================================================================
VBA version (runs unchanged in Access 2003 and Excel 2003)
===================================================================
Dim i, j, k, nbr, prod As Integer, div As Single
Dim daymth(31) As Integer

For i = 0 To 30
daymth(i) = 0
Next

For i = 1 To 9
For j = 1 To 9
For k = 1 To 9
If j <> i And k <> i And k <> j Then
nbr = CInt(CStr(i) & CStr(j) & CStr(k))
prod = i * j * k
div = nbr / prod
If nbr Mod prod = 0 Then
If div >= 1 And div <= 31 Then
daymth(CInt(div) - 1) = daymth(CInt(div) - 1) + 1
End If
End If
End If
Next
Next
Next

For i = 1 To 31
If daymth(i - 1) > 1 Then
If i > 12 Then
Debug.Print "Birth day = " & i
Else
Debug.Print "Birth month = " & i
End If
End If
Next
===================================================================
output in immediate window
Birth month = 8
Birth day = 18

On 2/4/2024 1:29 AM, Physfitfreak wrote:
> So this problem was well-posed after all. The story matched the math :)

"Well-posed" in the sense that if, for instance, there were more than
two repeating numbers in the list of "day or month" column, say, two
occurrences of 11's as well, then one could know neither the day nor the
month of her birthday. So I'm glad the result showed otherwise :)

Well, back then, I don't know how many decades ago, I had made sure this
was not the case anyway. But I don't remember how I knew it. I could've
solved it myself back then, or the math discussion of that feature about
3 digit integers itself proved it, in wherever article it was that I was
reading; by all probability one in a Scientific American magazine.

On 2/4/2024 12:10 PM, DFS wrote:
> On 2/3/2024 11:40 PM, DFS wrote:
>> On 1/31/2024 6:33 PM, Physfitfreak wrote:
>>> can you show a computer program to do solve the proposed problem?
>>
>> Of course.
>>
>> ===================================================================
>> nbr,prod,div = 0,0,0.0
>> daymth = [0] * 31
>>
>> for i in range(1,10):
>>      for j in range(1,10):
>>          for k in range(1,10):
>>              if (j!=i and k!=i and k!=j):
>>                  nbr = int(str(i) + str(j) + str(k))
>>                  prod = i * j * k;
>>                  div = nbr / prod
>>                  if nbr % prod == 0:
>>                      if div >= 1 and div <= 31:
>>                          daymth[int(div)-1] += 1
>>
>> for i in range(1,32):
>>      if daymth[i-1] > 1:
>>          if i > 12:
>>              print("Birth day   = %d" % (i))
>>          else:
>>              print("Birth month = %d" % (i))
>> ===================================================================
>>
>> $python age.py
>> Birth month = 8
>> Birth day   = 18
>
>
>
> ===================================================================
> C version
> ===================================================================
> #include <stdio.h>
> #include <stdlib.h>
> #include <string.h>
>
> int main(void) {
>
>   int i,j,k,nbr,prod;
>   char nbrstr[4];
>   double div;
>   int daymth[31] = {0};
>
>   for (i = 1; i < 10; i++) {
>     for (j = 1; j < 10; j++) {
>       for (k = 1; k < 10; k++) {
>         if (j!=i && k!=i && k!=j) {
>           sprintf(nbrstr,"%d%d%d", i,j,k);
>           nbr = atoi(nbrstr);
>           prod = i*j*k;
>           div = (double)nbr / (double)prod;
>           if (nbr % prod == 0) {
>             if (div >= 1 && div <= 31) {
>               //printf("Nbr=%d, Product=%d, Div=%.f\n",nbr,prod,div);
>               daymth[(int)(div)-1] += 1;
>             }
>           }
>         }
>       }
>     }
>   }
>
>   for (i=1;i<=31;i++) {
>     //printf("%d\n", daymth[i-1]);
>     if (daymth[i-1] > 1) {
>       if (i > 12)
>           {printf("Birth day   = %d\n", i);}
>         else
>           {printf("Birth month = %d\n", i);}
>     }
>   }
>
>   return(0);
> }
> ===================================================================
> $ ./age
> Birth month = 8
> Birth day   = 18
>
>
>
>
>
> ===================================================================
> VBA version (runs unchanged in Access 2003 and Excel 2003)
> ===================================================================
> Dim i, j, k, nbr, prod As Integer, div As Single
> Dim daymth(31) As Integer
>
> For i = 0 To 30
>  daymth(i) = 0
> Next
>
> For i = 1 To 9
>   For j = 1 To 9
>     For k = 1 To 9
>       If j <> i And k <> i And k <> j Then
>         nbr = CInt(CStr(i) & CStr(j) & CStr(k))
>         prod = i * j * k
>         div = nbr / prod
>         If nbr Mod prod = 0 Then
>           If div >= 1 And div <= 31 Then
>             daymth(CInt(div) - 1) = daymth(CInt(div) - 1) + 1
>           End If
>         End If
>       End If
>     Next
>   Next
> Next
>
> For i = 1 To 31
>   If daymth(i - 1) > 1 Then
>     If i > 12 Then
>         Debug.Print "Birth day   =  " & i
>       Else
>         Debug.Print "Birth month =  " & i
>     End If
>   End If
> Next
> ===================================================================
> output in immediate window
> Birth month = 8
> Birth day   = 18
>
>

Highly suspect to be the product of a simple AI request.

You can't prove your status of "code monkey" to me by posting codes in
any language. You prove _not_ to have that status by totally getting
confused about my chess problem that I proposed.

That's where you show yourself, not in the codes that you may have
copied and pasted.

On Sun, 4 Feb 2024 13:39:43 -0600, Physfitfreak wrote:

> You can't prove your status of "code monkey" to me by posting codes in
> any language. You prove _not_ to have that status by totally getting
> confused about my chess problem that I proposed.

In my FORTRAN IV class in 1965 we did a few chess problems. someone was
going to write a complete chess program real soon any day now. Hubris is a
wonderful thing.

On 2/4/2024 2:39 PM, Physfitfreak wrote:
> On 2/4/2024 12:10 PM, DFS wrote:
>> On 2/3/2024 11:40 PM, DFS wrote:
>>> On 1/31/2024 6:33 PM, Physfitfreak wrote:
>>>> can you show a computer program to do solve the proposed problem?
>>>
>>> Of course.
>>>
>>> ===================================================================
>>> nbr,prod,div = 0,0,0.0
>>> daymth = [0] * 31
>>>
>>> for i in range(1,10):
>>>      for j in range(1,10):
>>>          for k in range(1,10):
>>>              if (j!=i and k!=i and k!=j):
>>>                  nbr = int(str(i) + str(j) + str(k))
>>>                  prod = i * j * k;
>>>                  div = nbr / prod
>>>                  if nbr % prod == 0:
>>>                      if div >= 1 and div <= 31:
>>>                          daymth[int(div)-1] += 1
>>>
>>> for i in range(1,32):
>>>      if daymth[i-1] > 1:
>>>          if i > 12:
>>>              print("Birth day   = %d" % (i))
>>>          else:
>>>              print("Birth month = %d" % (i))
>>> ===================================================================
>>>
>>> $python age.py
>>> Birth month = 8
>>> Birth day   = 18
>>
>>
>>
>> ===================================================================
>> C version
>> ===================================================================
>> #include <stdio.h>
>> #include <stdlib.h>
>> #include <string.h>
>>
>> int main(void) {
>>
>>    int i,j,k,nbr,prod;
>>    char nbrstr[4];
>>    double div;
>>    int daymth[31] = {0};
>>
>>    for (i = 1; i < 10; i++) {
>>      for (j = 1; j < 10; j++) {
>>        for (k = 1; k < 10; k++) {
>>          if (j!=i && k!=i && k!=j) {
>>            sprintf(nbrstr,"%d%d%d", i,j,k);
>>            nbr = atoi(nbrstr);
>>            prod = i*j*k;
>>            div = (double)nbr / (double)prod;
>>            if (nbr % prod == 0) {
>>              if (div >= 1 && div <= 31) {
>>                //printf("Nbr=%d, Product=%d, Div=%.f\n",nbr,prod,div);
>>                daymth[(int)(div)-1] += 1;
>>              }
>>            }
>>          }
>>        }
>>      }
>>    }
>>
>>    for (i=1;i<=31;i++) {
>>      //printf("%d\n", daymth[i-1]);
>>      if (daymth[i-1] > 1) {
>>        if (i > 12)
>>            {printf("Birth day   = %d\n", i);}
>>          else
>>            {printf("Birth month = %d\n", i);}
>>      }
>>    }
>>
>>    return(0);
>> }
>> ===================================================================
>> $ ./age
>> Birth month = 8
>> Birth day   = 18
>>
>>
>>
>>
>>
>> ===================================================================
>> VBA version (runs unchanged in Access 2003 and Excel 2003)
>> ===================================================================
>> Dim i, j, k, nbr, prod As Integer, div As Single
>> Dim daymth(31) As Integer
>>
>> For i = 0 To 30
>>   daymth(i) = 0
>> Next
>>
>> For i = 1 To 9
>>    For j = 1 To 9
>>      For k = 1 To 9
>>        If j <> i And k <> i And k <> j Then
>>          nbr = CInt(CStr(i) & CStr(j) & CStr(k))
>>          prod = i * j * k
>>          div = nbr / prod
>>          If nbr Mod prod = 0 Then
>>            If div >= 1 And div <= 31 Then
>>              daymth(CInt(div) - 1) = daymth(CInt(div) - 1) + 1
>>            End If
>>          End If
>>        End If
>>      Next
>>    Next
>> Next
>>
>> For i = 1 To 31
>>    If daymth(i - 1) > 1 Then
>>      If i > 12 Then
>>          Debug.Print "Birth day   =  " & i
>>        Else
>>          Debug.Print "Birth month =  " & i
>>      End If
>>    End If
>> Next
>> ===================================================================
>> output in immediate window
>> Birth month = 8
>> Birth day   = 18
>>
>>
>
>
> Highly suspect to be the product of a simple AI request.

'suspect' only in the mind of a weird sand chimp who's embarrassed he
can't write such simple programs, even after decades of coding experience.

But go ahead and show me the AI program that generates such code, bozo.
I'll be waiting.

> You can't prove your status of "code monkey" to me by posting codes in
> any language.

I was curious how the same program looked, side by side, so I knocked
out the C and VBA versions this morning, in no time. Python is the
shortest and tidiest, as it usually is.

I notice "code monkey" is used only by the worst programmers on cola:
Feeb and you.

> You prove _not_ to have that status by totally getting
> confused about my chess problem that I proposed.

I still don't know what you were asking. I suspect you don't, either.
And you still haven't offered any solutions.

Next time pass it by a native English speaker before posting. And drop
all the fancy, irrelevant stories. It's math or logic, not bedtime
fantasies.

> That's where you show yourself, not in the codes that you may have
> copied and pasted.

Study and learn from them. You won't find them anywhere on the planet
but right here on cola. But feel free to spend days looking.

On 2/3/2024 4:00 AM, Physfitfreak wrote:
> "In each of my parties, a session is always included in which a
> chessboard is placed on the floor, with no chess pieces on it. There is
> a contest, and the winner is blindfolded and given two random chess
> pieces of same color - but not any pawns - out of my pocket, to place
> somewhere on the chessboard by the winner, in two of the squares. Then
> the blindfold is removed and the winner will look at the chessboard and
> counts the number of different moves he can make with the chess pieces
> from the squares that they are in. The winner will get as many gold
> coins from me as that count is. If I know in advance which two pieces
> will be given to the winner, I need to know how many gold coins I should
> bring with me to the party, so I could never find myself with not enough
> coins to give to the winner, and never carry with me even one gold coin
> that would never be needed to be given to the winner. Find how many
> coins I should bring with me to the party."

Looks like for the sub-"code monkeys" a bit of more explanation is due.

Holaku will give one gold coin for every different first move that the
winner can make on the board.

Example. If the two pieces happen to be two bishops, and if the
blindfolded winner happened to place one at the first square on the left
of the bottom row, and the other on the last square on the far right of
the bottom row, then winner will get 14 gold coins.

On 2/4/2024 8:53 PM, Physfitfreak wrote:
> On 2/3/2024 4:00 AM, Physfitfreak wrote:
>> "In each of my parties, a session is always included in which a
>> chessboard is placed on the floor, with no chess pieces on it. There
>> is a contest, and the winner is blindfolded and given two random chess
>> pieces of same color - but not any pawns - out of my pocket, to place
>> somewhere on the chessboard by the winner, in two of the squares. Then
>> the blindfold is removed and the winner will look at the chessboard
>> and counts the number of different moves he can make with the chess
>> pieces from the squares that they are in. The winner will get as many
>> gold coins from me as that count is. If I know in advance which two
>> pieces will be given to the winner, I need to know how many gold coins
>> I should bring with me to the party, so I could never find myself with
>> not enough coins to give to the winner, and never carry with me even
>> one gold coin that would never be needed to be given to the winner.
>> Find how many coins I should bring with me to the party."
>
>
> Looks like for the sub-"code monkeys" a bit of more explanation is due.
>
> Holaku will give one gold coin for every different first move that the
> winner can make on the board.
>
> Example. If the two pieces happen to be two bishops, and if the
> blindfolded winner happened to place one at the first square on the left
> of the bottom row, and the other on the last square on the far right of
> the bottom row, then winner will get 14 gold coins.

Ho Lee Fuk!

Are you now saying the challenge is to determine the max squares 2
random chess pieces can possibly cover with one move each, from any
random starting position? Is that it? Is that clear to you?

The original problem said "count the number of different moves he can
make". No mention of how many squares the move could cover. A rook in
the bottom right corner can make 2 moves (left and forward), but a rook
in the middle of the board can make 4 moves (left right forward backward).

Back to your example: What if one bishop is moved 1 square, and the
other is moved 3 squares? Those are valid moves, worth 4 gold coins.
In your scenario, does that count? Or does the move have to cover the
max squares available, given the starting position?

Also: a bishop in one corner and a queen in the far corner (both on the
same diagonal). If the queen moves first - off the diagonal - the
bishop can then cover 7 squares max. But if the bishop moves first,
he's blocked by the queen and can cover a max of only 6 squares. How is
such blocking to be addressed? Should the code solution maximize the
total squares by moving the blocking piece first?

Also:

* "the winner is blindfolded and given two random chess pieces
of same color"

* "If I know in advance which two pieces will be given to the winner"

If he's given random pieces, you can't know in advances which pieces
will be given. These contradictions make the setup even more confusing.

I told you you didn't even know what you were asking.

But if I'm finally grasping the challenge as I restated it, it's very
interesting and probably doable without too much trouble. Being
optimistic. So my plan would be to conceive of the board as a 2-d array
with locations (0,0) to (7,7), pick 2 random pieces, place them randomly
on the board, and try to maximize the available squares for each piece
to move, considering the starting position and behavior of each piece.
And the aforementioned blocking is an issue that has to be considered.

I'm getting a little ahead of myself.

Where's the original problem? Point us to that, so nothing gets lost in
chimp-babble translation.

On 2/4/2024 9:20 PM, DFS wrote:
> On 2/4/2024 8:53 PM, Physfitfreak wrote:
>> On 2/3/2024 4:00 AM, Physfitfreak wrote:
>>> "In each of my parties, a session is always included in which a
>>> chessboard is placed on the floor, with no chess pieces on it. There
>>> is a contest, and the winner is blindfolded and given two random
>>> chess pieces of same color - but not any pawns - out of my pocket, to
>>> place somewhere on the chessboard by the winner, in two of the
>>> squares. Then the blindfold is removed and the winner will look at
>>> the chessboard and counts the number of different moves he can make
>>> with the chess pieces from the squares that they are in. The winner
>>> will get as many gold coins from me as that count is. If I know in
>>> advance which two pieces will be given to the winner, I need to know
>>> how many gold coins I should bring with me to the party, so I could
>>> never find myself with not enough coins to give to the winner, and
>>> never carry with me even one gold coin that would never be needed to
>>> be given to the winner. Find how many coins I should bring with me to
>>> the party."
>>
>>
>> Looks like for the sub-"code monkeys" a bit of more explanation is due.
>>
>> Holaku will give one gold coin for every different first move that the
>> winner can make on the board.
>>
>> Example. If the two pieces happen to be two bishops, and if the
>> blindfolded winner happened to place one at the first square on the
>> left of the bottom row, and the other on the last square on the far
>> right of the bottom row, then winner will get 14 gold coins.
>
>
> Ho Lee Fuk!
>
> Are you now saying the challenge is to determine the max squares 2
> random chess pieces can possibly cover with one move each, from any
> random starting position?  Is that it?  Is that clear to you?
>
> The original problem said "count the number of different moves he can
> make".  No mention of how many squares the move could cover.  A rook in
> the bottom right corner can make 2 moves (left and forward), but a rook
> in the middle of the board can make 4 moves (left right forward backward).
>
> Back to your example: What if one bishop is moved 1 square, and the
> other is moved 3 squares?  Those are valid moves, worth 4 gold coins. In
> your scenario, does that count?  Or does the move have to cover the max
> squares available, given the starting position?
>
> Also: a bishop in one corner and a queen in the far corner (both on the
> same diagonal).  If the queen moves first - off the diagonal - the
> bishop can then cover 7 squares max.  But if the bishop moves first,
> he's blocked by the queen and can cover a max of only 6 squares.  How is
> such blocking to be addressed?  Should the code solution maximize the
> total squares by moving the blocking piece first?
>
>
> Also:
>
> * "the winner is blindfolded and given two random chess pieces
>    of same color"
>
> * "If I know in advance which two pieces will be given to the winner"
>
> If he's given random pieces, you can't know in advances which pieces
> will be given.  These contradictions make the setup even more confusing.
>
>
> I told you you didn't even know what you were asking.
>
> But if I'm finally grasping the challenge as I restated it, it's very
> interesting and probably doable without too much trouble.  Being
> optimistic.  So my plan would be to conceive of the board as a 2-d array
> with locations (0,0) to (7,7), pick 2 random pieces, place them randomly
> on the board, and try to maximize the available squares for each piece
> to move, considering the starting position and behavior of each piece.
> And the aforementioned blocking is an issue that has to be considered.
>
> I'm getting a little ahead of myself.
>
> Where's the original problem?  Point us to that, so nothing gets lost in
> chimp-babble translation.
>
>

You're really stupid. And not even a code monkey. A cro-magnon. It's
occasions like this that points to your species itself.

On 2/3/2024 4:00 AM, Physfitfreak wrote:
> Ghotbeddin:
>
>    "Your Majesty's wish will undoubtedly get fulfilled."
>
>

The rest of the story:

Ghotbeddin forgot that a daughter of Holaku even exists, and immediately
went home to work on the problem. Got his chessboard and placed it down
on the floor, on top of the fine Persian carpet woven in that same area,
according to Azarbayjan's styles which both colorwise and patterns were
distinct in Iran. He placed two same color pieces on the board and began
thinking...

Worked on it all night. By morning, his hopes of giving the tabulated
answers to Holaku on that morning had disappeared into thin air. It
would take some time to finish this job! So he went to bed tired and
beaten, and soon fell asleep. But shortly after he felt unusually cold.
Opened his eyes and found himself in his sleeping bag at the top of the
magic mountain!

Still remembering the dream, he stretched his hand into his backpack and
pulled out his Aspire One mini laptop dedicated to DOS, with qbasic on
it, prepared hot water to make tea, and as he gave out a good voluminous
fart he loudly said, "To you Pope The Penis X!" Then began coding the
now simple and totally under control problem. He got the answers,
tabulated them nicely, then hoped he would travel back to 13th century
next time he went to sleep, to give the table to Holaku Khan, and see
the beautiful daughter.

On Sunday, February 4, 2024 at 1:10:24 PM UTC-5, DFS wrote:

> sprintf(nbrstr,"%d%d%d", i,j,k);
> nbr = atoi(nbrstr);
>

Oh my fucking god! The incompetent code monkey strikes again!

Look at this piece of shit. The dumbfuck converts integers to a string and
then converts the string back into an integer! This is the pinnacle of
programming idiocy!

Just do:

int num = 100*i + 10*j + k;

>
> prod = i*j*k;
> div = (double)nbr / (double)prod;
> if (nbr % prod == 0) {
> if (div >= 1 && div <= 31) {
>

Then the retard casts integers to doubles (!!!) to perform divison!!!

A competent programmer just performs integer division directly:

div_t q = div(num, i*j*k);
if(q.rem == 0) { ... }

Get this supreme idiot out of here!

A "code monkey" is too good of a term for this infinite retard.

On 2/5/2024 7:06 AM, Lameass Larry Piet Master wrote:

> A "code monkey" is too good of a term for this infinite retard.

Feeb: I used a small C program to "brute force" the solution.

DFS : Where's your original code?

Feeb: Give me a minute. Mine was shit, so I'm busy copying ideas from
yours.

And that is a FACT. And that's why you'll NEVER post your original code.

On 2/5/2024 6:06 AM, Lord Master wrote:
> A "code monkey" is too good of a term for this infinite retard.

Ditto.

A code monkey at least understands what the chessboard problem is
asking. And can carefully proceed to code it. He isn't there yet. It
gets him confused.

On 2/5/2024 12:57 AM, Physfitfreak wrote:

> You're really stupid. And not even a code monkey. A cro-magnon. It's
> occasions like this that points to your species itself.

Here chimpy chimpy! Got a treat for you.

=======================================================================
//this progam determines the max number of squares 2 random non-pawn
chess pieces can
//possibly cover with one move each, from any random starting position.
Code assumes
//one piece cannot block the other.

//This code is hereby donated to the public domain

//usage:
//$ ./prog <leave blank and system will generate 2 random pieces>
// or
//$ ./prog <piece1> <piece2> no brackets
//$ ./prog Qe6 Ka1

//pieces and starting position must be entered using standard
// chess algebraic notation: Ba3 Kg1 Ne8 etc
//pieces : K king, Q queen, R rook, B bishop, N knight
//columns: abcdefgh
//rows : 1-8

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>

//K king, Q queen, R rook, B bishop, N knight
char *pieces[] = {"K","Q","R","B","N"};
char *pieceslong[] = {"King","Queen","Rook","Bishop","Knight"};

//build random piece and starting position
//column,row is converted to algebraic notation
char *genpiece(char newpiece[]) {
char piece[2], col[2];
sprintf(piece,"%s",pieces[rand() % 5]);
sprintf(col,"%c",(rand() % 8) + 97);
int row = (rand() % 8) + 1;
sprintf(newpiece,"%s%s%d",piece,col,row);
}

//find largest value
int getmax(int a, int b, int c, int d) {
int max = 0;
if (a > max) {max = a;}
if (b > max) {max = b;}
if (c > max) {max = c;}
if (d > max) {max = d;}
return max;
}

//find smallest value
int getmin(int a, int b, int c, int d) {
int min = 9;
if (a < min) {min = a;}
if (b < min) {min = b;}
if (c < min) {min = c;}
if (d < min) {min = d;}
return min;
}

// determine max number of squares that can be moved from the starting
position
int calcsquares(char piece[], char endpos[]) {

//min and max square moves by piece
//king 1,1
//queen 1,7
//rook 1,7
//bishop 1,7
//knight 3,3

int squares = 0;

//convert algebraic notation to col,row
//a1 = col 1,row 1 white, bottom left
//h8 = col 8,row 8 black, top right
int pcol = piece[1]-96;
int prow = atoi(&piece[2]);

//kings and knights will always be able to move 1 and 3 squares
//respectively, no matter the starting position
if (piece[0] == 'K') { squares += 1; }
if (piece[0] == 'N') { squares += 3; }

//left and right edges of board are 1 and 8
//bottom and top of board are 1 and 8

//rooks move on rows or columns
//queens move anywhere, but diagonal moves can never exceed the
// number of spaces available on rows and columns
//evaluate 4 move directions: left, right, forward, backward
int l=0,r=0,f=0,b=0;
if (piece[0] == 'R' || piece[0] == 'Q') {
l = pcol - 1;
r = 8 - pcol;
f = 8 - prow;
b = prow - 1;
squares += getmax(l,r,f,b);
//printf("%s: left %d, right %d, fwd %d, bwd %d
max=%d\n",piece,l,r,f,b,getmax(l,r,f,b));
}

//bishops move on diagonals (down left, down right, up left, up
right)
//https://www.geeksforgeeks.org/count-the-total-number-of-squares-that-can-be-visited-by-bishop-in-one-move/
//99 and -99 are used just to send 4 args to the functions
int dl=0, dr=0, ul=0, ur=0;
if (piece[0] == 'B') {
dl = 8 - getmax(prow, 9-pcol, -99, -99);
dr = getmin(prow, 9-pcol, 99, 99) -1;
ul = getmin(prow, pcol, 99, 99) - 1;
ur = 8 - getmax(prow, pcol, -99, -99);
squares += getmax(dl,dr,ul,ur);
//printf("%s: down left %d, down right %d, up left %d, up right %d
max=%d\n",piece,dl,dr,ul,ur,getmax(dl,dr,ul,ur));
}

return squares;

}

int main(int argc, char *argv[]) {
//TODO maybe:
// 1. handle piece blocking
// 2. allow 3+ pieces using an array
// 3. capture and display ending position

//random
srand(time(NULL));

//pieces
char p1[4], p2[4];

//no input from user, so system generates 2 random pieces
if (argc == 1)
{ genpiece(p1);
genpiece(p2);
while (strcmp(p1,p2)==0) { genpiece(p2); } //ensure 2 different
pieces
}

//invalid entry
if ((argc == 2) || (argc > 3))
{ printf("Enter 2 valid pieces\n");
exit(0);
}
//user inputs
if (argc == 3)
{ sprintf(p1,"%s",argv[1]);
sprintf(p2,"%s",argv[2]);
if (strcmp(p1,p2)==0)
{ printf("You entered 2 of the same piece \n");
exit(0);
}
}

//pieces and algebraic notation must be len(3)
if (strlen(p1)!=3 || strlen(p2)!=3)
{ printf("Enter 2 valid pieces\n");
exit(0);
}

//calc max squares moved per piece
int p1squares = calcsquares(p1);
int p2squares = calcsquares(p2);

//summary of squares moved
printf("\n");
printf(" Max\n");
printf("Start Squares\n");
printf("---------------\n");
printf("%-5s %d\n", p1,p1squares);
printf("%-5s %d\n", p2,p2squares);
printf("---------------\n");
printf("Total %d\n", p1squares + p2squares);
printf("---------------\n\n");

return(0);
} ====================================================================

Not well-tested. Free banana and back-shave if you find a calculation
bug. It will allow some bad input, so watch your paws.

All code freshly written except bishop/diagonal formulas from website.

On 2/5/2024 6:29 PM, DFS wrote:
> On 2/5/2024 12:57 AM, Physfitfreak wrote:
>
>> You're really stupid. And not even a code monkey. A cro-magnon. It's
>> occasions like this that points to your species itself.
>
> Here chimpy chimpy!  Got a treat for you.

bug!

replace line 62
int calcsquares(char piece[], char endpos[]) {

with
int calcsquares(char piece[]) {

On 2/5/2024 5:29 PM, DFS wrote:
> //$ ./prog <leave blank and system will generate 2 random pieces>

You have not understood the problem.

On 2/5/2024 5:37 PM, DFS wrote:
> On 2/5/2024 6:29 PM, DFS wrote:
>> On 2/5/2024 12:57 AM, Physfitfreak wrote:
>>
>>> You're really stupid. And not even a code monkey. A cro-magnon. It's
>>> occasions like this that points to your species itself.
>>
>> Here chimpy chimpy!  Got a treat for you.
>
> bug!
>
> replace line 62
> int calcsquares(char piece[], char endpos[]) {
>
> with
> int calcsquares(char piece[]) {
>
>

I don't think you have understood the problem.

If you think you have, then in your own words state the problem.

On 2/5/2024 1:51 AM, Physfitfreak wrote:
> On 2/3/2024 4:00 AM, Physfitfreak wrote:
>> Ghotbeddin:
>>
>>     "Your Majesty's wish will undoubtedly get fulfilled."
>>
>>
>
>
> The rest of the story:
>
> Ghotbeddin forgot that a daughter of Holaku even exists, and immediately
> went home to work on the problem. Got his chessboard and placed it down
> on the floor, on top of the fine Persian carpet woven in that same area,
> according to Azarbayjan's styles which both colorwise and patterns were
> distinct in Iran. He placed two same color pieces on the board and began
> thinking...
>
> Worked on it all night. By morning, his hopes of giving the tabulated
> answers to Holaku on that morning had disappeared into thin air. It
> would take some time to finish this job! So he went to bed tired and
> beaten, and soon fell asleep. But shortly after he felt unusually cold.
> Opened his eyes and found himself in his sleeping bag at the top of the
> magic mountain!
>
> Still remembering the dream, he stretched his hand into his backpack and
> pulled out his Aspire One mini laptop dedicated to DOS, with qbasic on
> it, prepared hot water to make tea, and as he gave out a good voluminous
> fart he loudly said, "To you Pope The Penis X!" Then began coding the
> now simple and totally under control problem. He got the answers,
> tabulated them nicely, then hoped he would travel back to 13th century
> next time he went to sleep, to give the table to Holaku Khan, and see
> the beautiful daughter.
>
>
>
>
>
>

So the story continues...

Days came and passed. None of the night sleeps resulted in a dream to
take him to the 13th century with the now ready table. So at night, when
warming himself with a little fire and getting ready to go to his
sleeping bag, he thought to himself, "If I don't travel back to Maragheh
observatory tonight, I'll just burn the one page table in the fire and
forget about it."

The night became morning, and Physfit still in his sleeping bag openned
his eyes and realized something was not right. There were clouds above
him! "At this altitude?..." he asked himself. He turned his head left
and found he was looking at urban areas of Dallas, with the Reunion
Tower over there standing by downtown! Turned his head right and saw
that he was lying down in his sleeping bag at the top of a 100 yard
mountain, with his house in the view, within a short walking distance!
He quickly, before anything get changed again, got up and put on his
mountain shoes and dress, and got ready to climb down fast before the
mountain gets bigger again.

By the time he reached the ground level, it was 4:45 pm and the sun was
setting, and in another 15 minutes he was home, at his computer, going
through the news.

He read somewhere that at least half of the Americans' missiles to hit
Houthi targets would only hit the adjacent areas, not the targets
themselves, but each time Houthis lauched a missile, it came down dead
correct and hit the target. Physfit wondered about it for a few moments.

There were a few related news pieces as well. In one of them, from a
Pakestani press outlet, they explained in detail how the missiles
automatically calculated the coordinates of the target. A reconnaissance
drone beforehand would get near enough to target to see it, then using
laser would fly on a straightline towards the target and record its own
coordinates at two different points on that straight line.

Then using such information, back home, the distance of the target to
the missiles launching site would accurately get calculated. Then they'd
launch the missiles.

Everything calculated were in two dimensions only. Just height and the
distance.

If the drone calculated coordinates of the two points on that line of
sight as (x_1, y_1) and (x_2, y_2), with x being the distance and y the
height, then the distance of the target to launch area would have any of
the two forms below:

x . y - x . y
1 2 2 1
x = -----------------
y - y
2 1

or:

/x - x \ . y
\ 2 1/ 1
x = x - --------------
1 y - y
2 1

And the Americans in charge being cro-magnons (and Nazi), seeing that
one of the above formulas can be derived from the other one, were
assuming it didn't matter which one to use for calculating x-intercept
for their missiles to hit Houthis targets. But Houthis, being Modern
Humans, always chose one of the above, and never the other.

So Physfit found out why about half of American missiles narrowly miss
their targets, while Houthis missiles always hit the targets.

1- Verify that the two formulas are correct, and algebraically related.

2- Assuming the drone calculated (x_1, y_1) as (1.31, 4.76) kilometers,
and (x_2, y_2) as (1.93, 3.24) kilometers, and assuming that for
shortest computation time, numbers are rounded to three digits in the
codes imbedded in drones and missiles, then calculate the x-intercept in
both ways.

3- Explain which of the two methods is being used by the Houthis, and why.

On 2/5/2024 7:41 PM, Physfitfreak wrote:
> On 2/5/2024 5:37 PM, DFS wrote:
>> On 2/5/2024 6:29 PM, DFS wrote:
>>> On 2/5/2024 12:57 AM, Physfitfreak wrote:
>>>
>>>> You're really stupid. And not even a code monkey. A cro-magnon. It's
>>>> occasions like this that points to your species itself.
>>>
>>> Here chimpy chimpy!  Got a treat for you.
>>
>> bug!
>>
>> replace line 62
>> int calcsquares(char piece[], char endpos[]) {
>>
>> with
>> int calcsquares(char piece[]) {
>>
>>
>
>
> I don't think you have understood the problem.
>
> If you think you have, then in your own words state the problem.

The very first comment line explains what the code does:

"this progam determines the max number of squares 2 random non-pawn
chess pieces can possibly cover with one move each, from any random
starting position. Code assumes one piece cannot block the other."

Which is based on what your example says it should do:

"Example. If the two pieces happen to be two bishops, and if the
blindfolded winner happened to place one at the first square on the left
of the bottom row, and the other on the last square on the far right of
the bottom row, then winner will get 14 gold coins."

Try it:

$ ./program Ba1 Bh1

Max
Start Squares
---------------
Ba1 7
Bh1 7
---------------
Total 14
---------------

* you have to enter the pieces using standard chess algebraic notation.

* if you don't enter anything, the program generates 2 random pieces.

Either way, it calculates the max squares each piece can move one time
(assuming no blocking).

On 2/5/2024 8:12 PM, DFS wrote:
> On 2/5/2024 7:41 PM, Physfitfreak wrote:
>> On 2/5/2024 5:37 PM, DFS wrote:
>>> On 2/5/2024 6:29 PM, DFS wrote:
>>>> On 2/5/2024 12:57 AM, Physfitfreak wrote:
>>>>
>>>>> You're really stupid. And not even a code monkey. A cro-magnon.
>>>>> It's occasions like this that points to your species itself.
>>>>
>>>> Here chimpy chimpy!  Got a treat for you.
>>>
>>> bug!
>>>
>>> replace line 62
>>> int calcsquares(char piece[], char endpos[]) {
>>>
>>> with
>>> int calcsquares(char piece[]) {
>>>
>>>
>>
>>
>> I don't think you have understood the problem.
>>
>> If you think you have, then in your own words state the problem.
>
>
> The very first comment line explains what the code does:
>
> "this progam determines the max number of squares 2 random non-pawn
> chess pieces can possibly cover with one move each, from any random
> starting position. Code assumes one piece cannot block the other."
>
>
> Which is based on what your example says it should do:
>
> "Example. If the two pieces happen to be two bishops, and if the
> blindfolded winner happened to place one at the first square on the left
> of the bottom row, and the other on the last square on the far right of
> the bottom row, then winner will get 14 gold coins."
>
>
> Try it:
>
> $ ./program Ba1 Bh1
>
>          Max
> Start   Squares
> ---------------
> Ba1        7
> Bh1        7
> ---------------
> Total      14
> ---------------
>
>
>
> * you have to enter the pieces using standard chess algebraic notation.
>
> * if you don't enter anything, the program generates 2 random pieces.
>
> Either way, it calculates the max squares each piece can move one time
> (assuming no blocking).
>
>
>
>

No.

You must understand the problem first. Any code monkey has good reading
comprehension, otherwise they're just useless cause they won't know what
it is that the employer wants them to do.