On Sun, 28 Jan 2024 15:49:29 -0600, Physfitfreak wrote:

> Another master of literature in Iran translated a work by Celine, titled
> in its English translation as, "Death On Credit", and that's the one
> among his works that became most popular in Iran.

amazon.com/dp/0811200175

In the US the New Directions edition was titled' Death on the Installment
Plan'. That and Journey are the most widely known. Some of his later books
aren't as popular as it became apparent he didn't like Jews very much. No
surprise; that's the default setting in France.

On 1/28/2024 6:40 PM, rbowman wrote:
> amazon.com/dp/0811200175
>
> In the US the New Directions edition was titled' Death on the Installment
> Plan'. That and Journey are the most widely known. Some of his later books
> aren't as popular as it became apparent he didn't like Jews very much. No
> surprise; that's the default setting in France.
>
>

Publishers must've intervened to change the title of the same
translation to better convey the meaning. This same translation was
before, titled as I said in last post:

https://www.amazon.com/Death-Credit-Louis-Ferdinand-Celine/dp/1847490417

Celine wanted the title to convey a sort of death that doesn't come at
once or the life that's not going out of the body at once, but in
chunks, piece by piece paid out to others who want it and own it
beforehand, and according to a plan before it even starts, until the
death is complete. The worst kind of trap one can find himself in while
being "free" in the society! That kind of situation.

Some are right now experiencing it. Including some of the Americans.
Especially the ones who should not be in prison. Find and read the
remarks that the guy who created the darknet is making inside prison. A
very bright guy, seeing his life getting thrown away in chunks before
his own eyes. His name is Ross Ulbricht. Funny that he also studied
physics, and did it in the same school that I did here (UTD) :) But he
was one generation after me. A very capable and bright guy, never to
come out again. It's just crazy. It is just what the title of Celine
work says.

I think "Death by Installments" is closest to that thought. But I still
think the one in Persian which Sahabi chose is the best match to Celine's.

On Sun, 28 Jan 2024 16:44:22 -0600, Physfitfreak wrote:

>
> But do at least tell us you did it by hand or by a program.
>

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

There may be a way to solve it with number theory, but I
don't know very much about number theory.

Anyway, for three-digit, non-repeating integers (also with
no digit being 0) there are 9*8*7 = 504 possibilities. Only
a crazy person would do it "by hand."

On 1/29/2024 2:28 AM, Farley Flud wrote:
> On Sun, 28 Jan 2024 16:44:22 -0600, Physfitfreak wrote:
>
>>
>> But do at least tell us you did it by hand or by a program.
>>
>
> I used a small C program to "brute force" the solution.
>
> There may be a way to solve it with number theory, but I
> don't know very much about number theory.
>
> Anyway, for three-digit, non-repeating integers (also with
> no digit being 0) there are 9*8*7 = 504 possibilities. Only
> a crazy person would do it "by hand."
>

By saying "by hand" I meant to go like this: There are 8 unknowns and 16
inequalities :)

And take that approach, and choose only integers in the solution areas.
It could be neat to try.

I haven't solved it either way. This is from years back, so I've
forgotten how I solved it. As soon as I get time I'll give it a try.
Then I can say for sure if your solution was good enough or not.

At this point I'm not even sure the problem is well-posed. I know that
years ago when I made this problem I was under the impression that it
was well-posed.

On 1/29/2024 3:28 AM, Farley Flud wrote:
> On Sun, 28 Jan 2024 16:44:22 -0600, Physfitfreak wrote:
>
>>
>> But do at least tell us you did it by hand or by a program.
>>
>
> I used a small C program to "brute force" the solution.
>
> There may be a way to solve it with number theory, but I
> don't know very much about number theory.

Like you said before: "Your method is know as 'brute force' and is
typical for someone with no mathematical skills."

On 1/31/2024 4:01 PM, DFS wrote:
> On 1/29/2024 3:28 AM, Farley Flud wrote:
>> On Sun, 28 Jan 2024 16:44:22 -0600, Physfitfreak wrote:
>>
>>>
>>> But do at least tell us you did it by hand or by a program.
>>>
>>
>> I used a small C program to "brute force" the solution.
>>
>> There may be a way to solve it with number theory, but I
>> don't know very much about number theory.
>
>
> Like you said before: "Your method is know as 'brute force' and is
> typical for someone with no mathematical skills."
>
>

This "computation" was way too simple to bother with anything but brute
force.

You, a cro-magnon who doesn't want to be a cro-magnon, who's ashamed of
being cro-magnon, and who has to finger himself every time he remembers
he's a cro-magnon, can you show a computer program to do solve the
proposed problem?

On 1/29/2024 2:28 AM, Farley Flud wrote:
> There may be a way to solve it with number theory, but I
> don't know very much about number theory.

Come to think of it, I may have concocted this problem from a math
number theory discussion in Scientific American. For sure, it was many
years ago. That's the only thing about it that I'm sure of :)

When I get time (for some reason these days various unusual chores are
popping up on me - each requiring a good part of a day's work), I'd like
to solve this both with a program and "with hand" the way I described
it. I would enjoy doing it, but deadlines are coming up and I got other
bullshit stuff to do on top of them.

Le 28-01-2024, Physfitfreak <Physfitfreak@gmail.com> a écrit :
> On 1/28/2024 6:31 AM, Farley Flud wrote:
>
> You didn't solve it by hands, did you!...

Of course he didn't. He solved it by either google or stackoverflow.

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

Le 31-01-2024, Physfitfreak <Physfitfreak@gmail.com> a écrit :
> On 1/31/2024 4:01 PM, DFS wrote:
>> On 1/29/2024 3:28 AM, Farley Flud wrote:
>>> On Sun, 28 Jan 2024 16:44:22 -0600, Physfitfreak wrote:
>>>
>>>>
>>>> But do at least tell us you did it by hand or by a program.
>>>>
>>>
>>> I used a small C program to "brute force" the solution.
>>>
>>> There may be a way to solve it with number theory, but I
>>> don't know very much about number theory.
>>
>>
>> Like you said before: "Your method is know as 'brute force' and is
>> typical for someone with no mathematical skills."
>
> This "computation" was way too simple to bother with anything but brute
> force.

You didn't understood his answer. DFS doesn't care about the way a
solution is found. But, FF/LP/NV/DG/whatever does care and he said using
brute force is bad when he is using it.

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

On 2/2/2024 4:54 PM, Stéphane CARPENTIER wrote:
> Le 31-01-2024, Sand Chimp <eek_and_ook@gmail.com> a écrit :
>> On 1/31/2024 4:01 PM, DFS wrote:
>>> On 1/29/2024 3:28 AM, Larry Piet wrote:
>>>> On Sun, 28 Jan 2024 16:44:22 -0600, Sand Chimp wrote:
>>>>
>>>>>
>>>>> But do at least tell us you did it by hand or by a program.
>>>>>
>>>>
>>>> I used a small C program to "brute force" the solution.
>>>>
>>>> There may be a way to solve it with number theory, but I
>>>> don't know very much about number theory.
>>>
>>>
>>> Like you said before: "Your method is know as 'brute force' and is
>>> typical for someone with no mathematical skills."
>>
>> This "computation" was way too simple to bother with anything but brute
>> force.

The parameters of your problem led to a quick computer solution that
made the problem seem simple, but as Feeb noted, some series never
converge and much time could be wasted.

So simplicity definitely doesn't preclude searching for a better
solution, that may be more complicated.

eg, computing Fibonacci numbers is much simpler than the harmonic series
calculations, but the standard Fibonacci recursive "brute force" method
is extremely costly and slow. Thus the Binet formula is employed.

========================================================================
//FIBONACCI SERIES
//0,1,1,2,3,5,8,13,21,34,55,89...

//COMPILE
//gcc -Wall -std=gnu99 -O3 Fibonacci.c -o Fib -lm

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

#define BILLION 1E9

long double Fibbrute(int num) {
long double b = 0;
if(num==0) {b = 0;}
else if(num==1) {b = 1;}
else if(num>=2) {b = Fibbrute(num-1) + Fibbrute(num-2);}
return b;
}

long double FibBinet(int num) {
long double b = (pow(1+sqrt(5),num) - pow(1-sqrt(5),num)) /
(pow(2,num) *
sqrt(5));
return b;
}

int main(int argc, char *argv[]) {
int i;
long double j;
struct timespec start, end;
double et;

char *Fibtype = argv[1];
int low = atoi(argv[2]);
int hi = atoi(argv[3]);

if (strcmp(Fibtype,"Recursive")==0) {
printf("Recursive\n");
for (i = low; i <= hi; i++) {
clock_gettime(CLOCK_MONOTONIC_RAW, &start);
j = Fibbrute(i);
clock_gettime(CLOCK_MONOTONIC_RAW, &end);
et = (end.tv_sec-start.tv_sec) + ((end.tv_nsec-start.tv_nsec) /
BILLION);
printf("Fibonacci %d = %.Lf (%.2f seconds)\n", i, j, et);
}
}

if (strcmp(Fibtype,"Binet")==0) {
printf("\nBinet forumula\n");
for (i = low; i <= hi; i++) {
clock_gettime(CLOCK_MONOTONIC_RAW, &start);
j = FibBinet(i);
clock_gettime(CLOCK_MONOTONIC_RAW, &end);
et = (end.tv_sec-start.tv_sec) + ((end.tv_nsec-start.tv_nsec) /
BILLION);
printf("Fibonacci %d = %.Lf (%.8f seconds)\n", i, j, et);
}
}

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

If you use the Recursive option, be in for long waits, while the Binet
formula is instantaneous.

On my mid-range system I get:

$ ./Fib Recursive 50 60
Recursive
Fibonacci 50 = 12586269025 (0.65 seconds)
Fibonacci 51 = 20365011074 (0.95 seconds)
Fibonacci 52 = 32951280099 (1.39 seconds)
Fibonacci 53 = 53316291173 (2.04 seconds)
Fibonacci 54 = 86267571272 (2.98 seconds)
Fibonacci 55 = 139583862445 (4.38 seconds)
Fibonacci 56 = 225851433717 (6.43 seconds)
Fibonacci 57 = 365435296162 (9.42 seconds)
Fibonacci 58 = 591286729879 (13.82 seconds)
Fibonacci 59 = 956722026041 (20.27 seconds)
Fibonacci 60 = 1548008755920 (29.70 seconds)

That's a lot of waiting.

$ ./Fib Binet 50 60
Binet forumula
Fibonacci 50 = 12586269025 (0.00002384 seconds)
Fibonacci 51 = 20365011074 (0.00000021 seconds)
Fibonacci 52 = 32951280099 (0.00000026 seconds)
Fibonacci 53 = 53316291173 (0.00000020 seconds)
Fibonacci 54 = 86267571272 (0.00000019 seconds)
Fibonacci 55 = 139583862445 (0.00000008 seconds)
Fibonacci 56 = 225851433717 (0.00000013 seconds)
Fibonacci 57 = 365435296162 (0.00000008 seconds)
Fibonacci 58 = 591286729879 (0.00000014 seconds)
Fibonacci 59 = 956722026041 (0.00000014 seconds)
Fibonacci 60 = 1548008755920 (0.00000036 seconds)

> You didn't understood his answer. DFS doesn't care about the way a
> solution is found. But, FF/LP/NV/DG/whatever does care and he said using
> brute force is bad when he is using it.

Feeb is big on 'rules for thee but not for me'.

Also big on bullshit:

Feeb: "I know EVERYTHING"
Feeb: "I don't know very much about number theory."

On 1/27/2024 5:22 PM, Physfitfreak wrote:
> Tusi right away gave him two other three-digit numbers that had exactly
> the same properties! One would lead to the month (like Farvardin = 1,
> Ordibehesht = 2, etc) and the other would lead to the day of the month
> corresponding to the daughter's birthday by the same rules Ghotbeddin
> had described a few minutes back. So the little personal party that
> Ghotbeddin / Physfit had imagined for himself that night was, so soon,
> over :)

Thus the story continues...

The two scientists got out and locked the gate and left.

That day, in the evening, a party was to hold in Holaku's Summer
residence not that far from Maragheh. And the two were both invited!

Ghotbeddin got home and hit the sack fast and early to wake up fully
rested before attending the party. He couldn't be contained inside his
own skin, when thinking about the prospect of seeing Holaku's daughter
again within that same day...

As he slowly drifted off into sleep he dreamed that wherever he was, he
was actually already in that party but had just noticed it! He didn't
get time to think how it happened and why he'd only now realized where
he'd been all this time. Holaku was sitting on a throne across the huge
room and some of the vazirs were here and there chatting. But he knew
that he had not yet seen the daughter, so he made himself sure he'll
stay until she shows up. Also, he knew that he and Holaku both were
waiting for Tusi to arrive, because Holaku had something to ask from him.

But there was no sign of Tusi. At his home, he had come up with an idea
which needed the use of some tables of numbers kept at the observatory,
and he had chosen to go to the observatory in the evening, not even to
Hulaku's party where he was invited!

So after some time, at some point Holaku signaled to have a talk with
Ghotbeddin. A servant and one of the vazirs immediately came over to
Ghotbeddin and together walked to where Holaku was sitting.

Holaku to Ghotbeddin:

"They tell me you are a very smart man to be in the observatory,
helping someone like Tusi. Do you think you are as smart as Tusi?"

Ghotbeddin made a faint smile and said:

"Your Majesty, I am not blessed with as much talent as God has
bestowed upon Your Majesty _or_ Tusi."

Holaku:

"I have a task for Tusi to accomplish, but in his absence I want you
to do it."

Ghotbeddin:

"Your Majesty's wish is my utmost desire."

Holaku:

"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."

Ghotbeddin:

"Your Majesty's wish will undoubtedly get fulfilled."

How many gold coins should Holaku Khan take with him to his parties?

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 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.

On 2/2/2024 7:17 PM, DFS wrote:
>>>>> On Sun, 28 Jan 2024 16:44:22 -0600, Sand Chimp wrote:
>>>>>
>>>>>>
>>> This "computation" was way too simple to bother with anything but brute
>>> force.
> eg, computing Fibonacci numbers is much simpler than the harmonic series
> calculations, but the standard Fibonacci recursive "brute force" method
> is extremely costly and slow.  Thus the Binet formula is employed.
Or you use this extremely fast brute-force method: pre-populate an array
with the Fibonacci numbers from 0 to N. It's about as fast as the Binet
formula - but it's actually more correct, since the Binet formula relies
on the precision of the sqrt(5).
=======================================================================
//COMPILE
//gcc -Wall -std=gnu99 -O3 Fibonacci.c -o Fib -lm
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <math.h>
int main(int argc, char *argv[]) {
int i;
struct timespec start, end;
double et;
int low = atoi(argv[1]);
int hi = atoi(argv[2]);
clock_gettime(CLOCK_MONOTONIC_RAW, &start);
long double *Farray = malloc((hi + 1) * sizeof(long double));
for (i = 0; i <= hi; i++) {
if(i==0) {Farray[i] = 0;}
else if(i==1) {Farray[i] = 1;}
else if(i>=2) {Farray[i] = Farray[i-1] + Farray[i-2];}
}
for (i = low; i <= hi; i++) {
printf("Fibonacci %d = %.Lf\n", i, Farray[i]);
}
clock_gettime(CLOCK_MONOTONIC_RAW, &end);
et = (end.tv_sec-start.tv_sec) + ((end.tv_nsec-start.tv_nsec)/1E9);
printf("%.8f seconds\n", et);
free(Farray);
return(0);
}
=======================================================================

$ ./Fib 10000 10000
Fibonacci 10000 =
33644764876431783337262952613817637625229469942184118735495552216602061536217341818627149116984952349519390497344701696741933112984689952173588604968251546055527572946271490132515369934789123193382744900183497988764290618464122776520567087489368586385503635361245930634568340857449318308576412077472755747233938138345827443350926734762619602821442846566648827371918745309399412426040077914636747232443711591065325762404713792346070417366277737155532731409213917909873081142358447338484840333953463883253988782222040273055732535087462527499340083771920709136632413461078215097556698713674037903885240353549341452751583638605591854208249720510131862875052478850595640733413441381562004437859327806798430918962698309853023364479022494827705651212315616526784449087106522966559995852113571643683513204363872360889721347466906428608550211618778604262630409660082212659482658909400908738190097560755731044169859227519432247112849371000664609017987408466476775064767189066079118632284980287775721005249084965661694775769153059231446465557499825138752050519720707155488718050592417156777589525370620729437792430449856295746196507635957570462496208097570657570789309288519964020514618311952531947962859548854335610669647999399349728133713604497953794313311987062809817418425797636369901169043079567809260765221238593076617485663685280543059382846507547174885433188225693563941306654616427686438920336509098253219599796503034867906791345461220555862703653952638078077967889222241657993029553025294391149023511255404242069474007708668336078835294557756728473882839801539912942027214648166112862175009599880562369202237302328512819587986993874339187915427797272891139812920337896354920554999623151702554847963100911418782881378701409582923396695194563015653584439792720296758578054476613718761992114689400942978388470781387313800294054286371847353420284074909564876051387501560022008325167623580090109033955897935513021907991870866526175985233112323460090307674541596341172255487145592168651676845954314300735531547344635695242887995601514335173698784080214249513581747349008988088834033301305035849728
0.00034628 seconds

On 2/3/2024 5:00 AM, Physfitfreak wrote:

> Holaku:
>
>    "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."

> How many gold coins should Holaku Khan take with him to his parties?

2

On 2/3/2024 11:57 AM, DFS wrote:
> On 2/3/2024 5:00 AM, SandChimp wrote:
>
>> Holaku:
>>
>>     "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."
>
>
>> How many gold coins should Holaku Khan take with him to his parties?
>
> 2

I almost said "Unsolvable, because they were random pieces in a random
placement". But I figured it was a chimpish trick question, and read it
again and noticed your problem didn't ask for the number of possible
moves, or the direction, both of which would be impacted by the placement.

You specified non-pawns because pawns can't move again if placed on the
opposing side, but all other pieces can move no matter where they're
placed on the board, even if another piece is directly adjacent.

So you have 2 non-pawns, each of which can make 1 move.

On Sat, 3 Feb 2024 11:40:56 -0500, DFS wrote:

>
> //COMPILE
> //gcc -Wall -std=gnu99 -O3 Fibonacci.c -o Fib -lm
>

Oh my fucking god! What an absolute horrid piece of fucking
shit!

>
> long double *Farray = malloc((hi + 1) * sizeof(long double));
>

Long doubles! Oh my fucking god! The long double type has a decimal
precision of about 20 places. If the Fibonacci number exceeds 20 places
it will break down -- and that is EXACTLY what we see.

Your abominable junk gives for ./Fib 98 98:

Fibonacci 98 = 135301852344706746048

The correct answer is: 135301852344706746049

You shit answer is wrong in the last place.

Every number above 97 will be WRONG, WRONG, WRONG.

Example:

Fibonacci 1000 = 43466557686937456441067806760621305207538765975592846737908149375407140100631754593595544200722179756589278396980379469175286581878650684127526345486516252019213839733161955037779772590856692113986334761156608

The CORRECT answer is:

43466557686937456435688527675040625802564660517371780402481729089536555417949051890403879840079255169295922593080322634775209689623239873322471161642996440906533187938298969649928516003704476137795166849228875

After the 18th decimal place your answer is TOTALLY FUBAR.

Congratulations!

You win the award for the stupidest dumbfuck C program in the
history of computing.

On Sat, 03 Feb 2024 17:38:21 +0000, Farley Flud wrote:

>
> Every number above 97 will be WRONG, WRONG, WRONG.
>

I make boo boo!

Every number above 96 will be DEAD FUCKING WRONG.

Ha, ha, ha, ha, ha, ha, ha, ha, ha!

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 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.

I get that feeling when in public media somebody who's supposed to
explain something for the general people uses "football" terms in his
words. Imagine Biden, while at the podium speaking, turning sideways and
beginning peeing on the floor, then turning back towards the audience
and continuing the talk as if nothing inappropriate was done. Or, ...
suddenly throw in a sentence in Mayan language... then continue in
English. Hahhahah :)

It amounts to being on the left side of the intelligence curve, where
half of the Americans happily reside. RIP Carlin... I hear you.

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. 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.

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.

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

If my memory serves me right, that's how Ken Thompson, the other of the
duo with Dennis Ritchie, who together developed Unix, became expert in
programming and OSs. I think he wanted to make his chess program faster
and faster. I think that was the whole deal for him behind all that work
:) He won some chess computer competitions too, I think.

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. 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".

So, each of you in COLA, are you even a code monkey? Farley says you
are, but I even doubt that. I think you're just foolish little loud
mouths as far as programming is concerned. So far, only Farley has
proved himself as a real programmer.

Speaking of a computer science class, the only one I took was in Summer
1979 to learn PL/I. No other languages were being taught in that Summer.
It was actually a graduate course in computer science, so a lot of
programming knowledge in the students were assumed by the professor in
its covering of that language. But for me it was the first touch of a
programming language. Thanks god the text was excellent. A dictionary
size big black book of almost 1000 pages. That was my source really, not
what was being discussed in the classroom. My understanding of the
verbal English hadn't matured yet and I'd muss most of what the prof was
so elaborately explaining. I suspect that the aim of that course was to
prepare the students on _creating_ better languages. But the text chosen
was very comprehensive, covering every programming skill, all the
sensitive areas, all the usual mistakes, all the important concepts
associated to programming in general and in that language. I read and
understood that book from begin to end!

There was also a 13 or so year old kid in the classroom sitting with his
father, and asking most of the questions! One of those who even in
middle school knew how to program well and had a talent for it.

The course was 5 semester hours! A heck of a lot of material packed into
a month and a half Summer term.

On 2/3/2024 12:38 PM, Farley Flud wrote:
> On Sat, 3 Feb 2024 11:40:56 -0500, DFS wrote:
>
> Long doubles! Oh my fucking god! The long double type has a decimal
> precision of about 20 places. If the Fibonacci number exceeds 20 places
> it will break down -- and that is EXACTLY what we see.
I figured not using a BigNum library would cause trouble.

> Your abominable junk gives for ./Fib 98 98:
> Fibonacci 98 = 135301852344706746048
> The correct answer is: 135301852344706746049

> Fibonacci 1000 = 43466557686937456441067806760621305207538765975592846737908149375407140100631754593595544200722179756589278396980379469175286581878650684127526345486516252019213839733161955037779772590856692113986334761156608
> The CORRECT answer is:
> 43466557686937456435688527675040625802564660517371780402481729089536555417949051890403879840079255169295922593080322634775209689623239873322471161642996440906533187938298969649928516003704476137795166849228875

Which website did you get the correct answers from? Cause they sure
didn't come from your own code.

10 lines of Python, no need to import bignum modules
-------------------------------------------------------------
import sys
Farray = []
lo,hi = int(sys.argv[1]), int(sys.argv[2])
for i in range(hi+1):
if i >=2:
Farray.append(Farray[i-1] + Farray[i-2])
else:
Farray.append(i)
for i in range(lo,hi+1):
print("F(%d) = %d (%d digits)" % (i, Farray[i], len(str(Farray[i]))))
-------------------------------------------------------------

F(98) = 135301852344706746049 (21 digits)
F(100) = 354224848179261915075 (21 digits)
F(1000) =
43466557686937456435688527675040625802564660517371780402481729089536555417949051890403879840079255169295922593080322634775209689623239873322471161642996440906533187938298969649928516003704476137795166849228875
(209 digits)
F(10000) =
33644764876431783266621612005107543310302148460680063906564769974680081442166662368155595513633734025582065332680836159373734790483865268263040892463056431887354544369559827491606602099884183933864652731300088830269235673613135117579297437854413752130520504347701602264758318906527890855154366159582987279682987510631200575428783453215515103870818298969791613127856265033195487140214287532698187962046936097879900350962302291026368131493195275630227837628441540360584402572114334961180023091208287046088923962328835461505776583271252546093591128203925285393434620904245248929403901706233888991085841065183173360437470737908552631764325733993712871937587746897479926305837065742830161637408969178426378624212835258112820516370298089332099905707920064367426202389783111470054074998459250360633560933883831923386783056136435351892133279732908133732642652633989763922723407882928177953580570993691049175470808931841056146322338217465637321248226383092103297701648054726243842374862411453093812206564914032751086643394517512161526545361333111314042436854805106765843493523836959653428071768775328348234345557366719731392746273629108210679280784718035329131176778924659089938635459327894523777674406192240337638674004021330343297496902028328145933418826817683893072003634795623117103101291953169794607632737589253530772552375943788434504067715555779056450443016640119462580972216729758615026968443146952034614932291105970676243268515992834709891284706740862008587135016260312071903172086094081298321581077282076353186624611278245537208532365305775956430072517744315051539600905168603220349163222640885248852433158051534849622434848299380905070483482449327453732624567755879089187190803662058009594743150052402532709746995318770724376825907419939632265984147498193609285223945039707165443156421328157688908058783183404917434556270520223564846495196112460268313970975069382648706613264507665074611512677522748621598642530711298441182622661057163515069260029861704945425047491378115154139941550671256271197133252763631939606902895650288268608362241082050562430701794976171121233066073310059947366875
(2090 digits)

On 2/3/2024 12:48 PM, Lameass Larry wrote:
> On Sat, 03 Feb 2024 17:38:21 +0000, Larry Pietraskiewicz wrote:
>
>>
>> Every number above 97 will be WRONG, WRONG, WRONG.
>>
>
> I make boo boo!

No way!

> Every number above 96 will be DEAD FUCKING WRONG.

So F(97) is off by 1 in:

83 quintillion
621 quadrillion
143 trillion
489 billion
848 million
422 thousand
and 877

Congratulations! You should spend a month writing a paper about it.

> Ha, ha, ha, ha, ha, ha, ha, ha, ha!

You're worse than Cackling Kamala Harris.

On 2/3/2024 5:17 PM, SandChimp wrote:

> It amounts to being on the left side of the intelligence curve, where
> half of the Americans happily reside. RIP Carlin... I hear you.

Can you imagine what the intelligence curve of you 97-IQ Iranian chimps
looks like?

> 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. 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".

No programming necessary whatsoever. The answers are either 2, or there
can be no answer to the question as you posed it.

--------------------------------------------------------------------------
"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."
---------------------------------------------------------------------------

My initial answer was that the 2 chess pieces can only ever make 1 move
each, so he needs to bring exactly 2 gold coins.

But I see you did specify "number of different moves he can make". But
you also said the pieces are placed randomly on the board. Thus the
question "Exact number of coins" cannot be answered because pieces
placed in the middle of the board can move in all directions, but pieces
placed on the edges (ranks 1 and 8, files a and h) cannot.

eg a bishop on ranks 2-7, files b-g has 3 or 4 possible moves. A bishop
on rank 1 or 8 has 1 or 2 possible moves.

Similarly, a rook on ranks 2-7, files b-g has 3 or 4 possible moves, but
a rook on rank 1 or 8 has 1 or 2 possible moves.

You also didn't specify whether or not a blocking piece could first be
moved to allow the blocked piece to move (put bishops on a1 and b2. The
bishop at b2 has to move before a1 can move).

So, given random placement, you could never calculate the number of
possible moves of the 2 pieces.

Try again.

> So, each of you in COLA, are you even a code monkey? Farley says you
> are, but I even doubt that. I think you're just foolish little loud
> mouths as far as programming is concerned.

I've been here since mid-2004. The ONLY true programming loudmouth that
has been in cola for nearly 20 years is Lameass Larry Piet. Since early
2015 he frequently brags about his programming skillz, which are in
reality mediocre at best. It's a joke.

Here's some of the nutty brags he made about himself:

ALWAYS RIGHT
ARCHITECT
All code is ABSOLUTELY PERFECT
COMPOSER
CREATIVE man
EXPERT in image processing and audio processing
INFALLIBLE
INNOVATOR
NEVER loses
REAL MAN
a highly competent TECHNICAL MAN
as superior as it is possible to get
assembly language genius
began programming in machine language
board-certified psychiatrist
builds homemade audio equipment that beats ALL commercial equipment
built a fantastic website
businessperson
C programmer extraordinaire
can do anything and everything [software-related]
can program ANYTHING.
computer scientist
computing virtuoso
consultant for the US Army
could've saved NASA with his perfect simulation
electrical engineer
ex heroin addict
expert in *all* aspects of both GNU/Linux and Windows
Give me C, simple and unchanging C, and I shall bury these
Microslop cronies.
I can program ANYTHING
keyboardist
knows EVERYTHING
magnificent programming prowess
material scientist
mathematician
mechanical engineer
music producer
NEVER incorrect
perfect in every way
Perl guru
programming wizard
research scientist
straight A college and grad student
super engineer
talented artist
the pinnacle of intellectual and physical perfection
three peer-reviewed publications
true innovator
went to a REAL institution of higher learning
worldly and seasoned programmer
worth (at least) 5 billion people
worth 10 billion people
worth at least a billion people

babble babble

> So far, only Farley has proved himself as a real programmer.

No such thing, and Feeb has only proven himself to be a lying lout and
IT failure and programming nincompoop. The fraud couldn't even sort a
list of first-last names using C.

You're his 2nd cola groupie (Slimer was his first). You should have
more self-esteem.

> There was also a 13 or so year old kid in the classroom sitting with his
> father, and asking most of the questions! One of those who even in
> middle school knew how to program well and had a talent for it.

eh? Not long ago you insisted over and over, directly to me, that good
programming skills doesn't require talent.

You've been sucking up to Feeb too much.

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.

On 2/3/2024 6:58 PM, DFS wrote:
> On 2/3/2024 5:17 PM, SandChimp wrote:
>
>> It amounts to being on the left side of the intelligence curve, where
>> half of the Americans happily reside. RIP Carlin... I hear you.
>
> Can you imagine what the intelligence curve of you 97-IQ Iranian chimps
> looks like?
>
>
>
>> 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. 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".
>
> No programming necessary whatsoever.  The answers are either 2, or there
> can be no answer to the question as you posed it.
>
> --------------------------------------------------------------------------
> "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."
> ---------------------------------------------------------------------------
>
> My initial answer was that the 2 chess pieces can only ever make 1 move
> each, so he needs to bring exactly 2 gold coins.
>
> But I see you did specify "number of different moves he can make".  But
> you also said the pieces are placed randomly on the board.  Thus the
> question "Exact number of coins" cannot be answered because pieces
> placed in the middle of the board can move in all directions, but pieces
> placed on the edges (ranks 1 and 8, files a and h) cannot.
>
> eg a bishop on ranks 2-7, files b-g has 3 or 4 possible moves.  A bishop
> on rank 1 or 8 has 1 or 2 possible moves.
>
> Similarly, a rook on ranks 2-7, files b-g has 3 or 4 possible moves, but
> a rook on rank 1 or 8 has 1 or 2 possible moves.
>
> You also didn't specify whether or not a blocking piece could first be
> moved to allow the blocked piece to move (put bishops on a1 and b2.  The
> bishop at b2 has to move before a1 can move).
>
> So, given random placement, you could never calculate the number of
> possible moves of the 2 pieces.
>
> Try again.
>
>
>
>> So, each of you in COLA, are you even a code monkey? Farley says you
>> are, but I even doubt that. I think you're just foolish little loud
>> mouths as far as programming is concerned.
>
> I've been here since mid-2004.  The ONLY true programming loudmouth that
> has been in cola for nearly 20 years is Lameass Larry Piet.  Since early
> 2015 he frequently brags about his programming skillz, which are in
> reality mediocre at best.  It's a joke.
>
>
> Here's some of the nutty brags he made about himself:
>
> ALWAYS RIGHT
> ARCHITECT
> All code is ABSOLUTELY PERFECT
> COMPOSER
> CREATIVE man
> EXPERT in image processing and audio processing
> INFALLIBLE
> INNOVATOR
> NEVER loses
> REAL MAN
> a highly competent TECHNICAL MAN
> as superior as it is possible to get
> assembly language genius
> began programming in machine language
> board-certified psychiatrist
> builds homemade audio equipment that beats ALL commercial equipment
> built a fantastic website
> businessperson
> C programmer extraordinaire
> can do anything and everything [software-related]
> can program ANYTHING.
> computer scientist
> computing virtuoso
> consultant for the US Army
> could've saved NASA with his perfect simulation
> electrical engineer
> ex heroin addict
> expert in *all* aspects of both GNU/Linux and Windows
> Give me C, simple and unchanging C, and I shall bury these
>  Microslop cronies.
> I can program ANYTHING
> keyboardist
> knows EVERYTHING
> magnificent programming prowess
> material scientist
> mathematician
> mechanical engineer
> music producer
> NEVER incorrect
> perfect in every way
> Perl guru
> programming wizard
> research scientist
> straight A college and grad student
> super engineer
> talented artist
> the pinnacle of intellectual and physical perfection
> three peer-reviewed publications
> true innovator
> went to a REAL institution of higher learning
> worldly and seasoned programmer
> worth (at least) 5 billion people
> worth 10 billion people
> worth at least a billion people
>
> babble babble
>
>
>
>> So far, only Farley has proved himself as a real programmer.
>
> No such thing, and Feeb has only proven himself to be a lying lout and
> IT failure and programming nincompoop.  The fraud couldn't even sort a
> list of first-last names using C.
>
> You're his 2nd cola groupie (Slimer was his first).  You should have
> more self-esteem.
>
>
>
>> There was also a 13 or so year old kid in the classroom sitting with
>> his father, and asking most of the questions! One of those who even in
>> middle school knew how to program well and had a talent for it.
>
> eh?  Not long ago you insisted over and over, directly to me, that good
> programming skills doesn't require talent.
>
> You've been sucking up to Feeb too much.
>
>

So Farley has enthusiasm. What's wrong with that? In a usenet setting it
is great to have enthusiasm.

Talk is cheap, he solved some of the problems I posed, and you and
others didn't. That's what matters. He also proposed some problems and
none of you could answer. That counts a lot. He's alive, you guys are
half dead. Some among you are stone dead! Totally dysfunctional.

Your answer to this latest problem is plain wrong. This far, you're not
even a code monkey. Sorry.

Do you have a music background?

On 2/3/2024 11:13 AM, DFS wrote:
> On 2/3/2024 11:57 AM, DFS wrote:
>> On 2/3/2024 5:00 AM, SandChimp wrote:
>>
>>> Holaku:
>>>
>>>     "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."
>>
>>
>>> How many gold coins should Holaku Khan take with him to his parties?
>>
>> 2
>
>
>
> I almost said "Unsolvable, because they were random pieces in a random
> placement".  But I figured it was a chimpish trick question, and read it
> again and noticed your problem didn't ask for the number of possible
> moves, or the direction, both of which would be impacted by the placement.
>
> You specified non-pawns because pawns can't move again if placed on the
> opposing side, but all other pieces can move no matter where they're
> placed on the board, even if another piece is directly adjacent.
>
> So you have 2 non-pawns, each of which can make 1 move.
>
>

Don't let Farley see this answer of yours :) You'll get a bad day.

On 2/3/2024 11:46 PM, Physfitfreak wrote:
> On 2/3/2024 6:58 PM, DFS wrote:
>> On 2/3/2024 5:17 PM, SandChimp wrote:
>>
>>> It amounts to being on the left side of the intelligence curve, where
>>> half of the Americans happily reside. RIP Carlin... I hear you.
>>
>> Can you imagine what the intelligence curve of you 97-IQ Iranian
>> chimps looks like?

Bunch of hairy, smooth-brained imbeciles committing honor killings and
sponsoring terrorism wherever they can.

>>> 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. 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".
>>
>> No programming necessary whatsoever.  The answers are either 2, or
>> there can be no answer to the question as you posed it.
>>
>> --------------------------------------------------------------------------
>> "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."
>> ---------------------------------------------------------------------------
>>
>> My initial answer was that the 2 chess pieces can only ever make 1
>> move each, so he needs to bring exactly 2 gold coins.
>>
>> But I see you did specify "number of different moves he can make".
>> But you also said the pieces are placed randomly on the board.  Thus
>> the question "Exact number of coins" cannot be answered because pieces
>> placed in the middle of the board can move in all directions, but
>> pieces placed on the edges (ranks 1 and 8, files a and h) cannot.
>>
>> eg a bishop on ranks 2-7, files b-g has 3 or 4 possible moves.  A
>> bishop on rank 1 or 8 has 1 or 2 possible moves.
>>
>> Similarly, a rook on ranks 2-7, files b-g has 3 or 4 possible moves,
>> but a rook on rank 1 or 8 has 1 or 2 possible moves.
>>
>> You also didn't specify whether or not a blocking piece could first be
>> moved to allow the blocked piece to move (put bishops on a1 and b2.
>> The bishop at b2 has to move before a1 can move).
>>
>> So, given random placement, you could never calculate the number of
>> possible moves of the 2 pieces.
>>
>> Try again.

Well?

>>> So, each of you in COLA, are you even a code monkey? Farley says you
>>> are, but I even doubt that. I think you're just foolish little loud
>>> mouths as far as programming is concerned.
>>
>> I've been here since mid-2004.  The ONLY true programming loudmouth
>> that has been in cola for nearly 20 years is Lameass Larry Piet.
>> Since early 2015 he frequently brags about his programming skillz,
>> which are in reality mediocre at best.  It's a joke.
>>
>>
>> Here's some of the nutty brags he made about himself:
>>
>> ALWAYS RIGHT
>> ARCHITECT
>> All code is ABSOLUTELY PERFECT
>> COMPOSER
>> CREATIVE man
>> EXPERT in image processing and audio processing
>> INFALLIBLE
>> INNOVATOR
>> NEVER loses
>> REAL MAN
>> a highly competent TECHNICAL MAN
>> as superior as it is possible to get
>> assembly language genius
>> began programming in machine language
>> board-certified psychiatrist
>> builds homemade audio equipment that beats ALL commercial equipment
>> built a fantastic website
>> businessperson
>> C programmer extraordinaire
>> can do anything and everything [software-related]
>> can program ANYTHING.
>> computer scientist
>> computing virtuoso
>> consultant for the US Army
>> could've saved NASA with his perfect simulation
>> electrical engineer
>> ex heroin addict
>> expert in *all* aspects of both GNU/Linux and Windows
>> Give me C, simple and unchanging C, and I shall bury these
>>   Microslop cronies.
>> I can program ANYTHING
>> keyboardist
>> knows EVERYTHING
>> magnificent programming prowess
>> material scientist
>> mathematician
>> mechanical engineer
>> music producer
>> NEVER incorrect
>> perfect in every way
>> Perl guru
>> programming wizard
>> research scientist
>> straight A college and grad student
>> super engineer
>> talented artist
>> the pinnacle of intellectual and physical perfection
>> three peer-reviewed publications
>> true innovator
>> went to a REAL institution of higher learning
>> worldly and seasoned programmer
>> worth (at least) 5 billion people
>> worth 10 billion people
>> worth at least a billion people
>>
>> babble babble
>>
>>
>>
>>> So far, only Farley has proved himself as a real programmer.
>>
>> No such thing, and Feeb has only proven himself to be a lying lout and
>> IT failure and programming nincompoop.  The fraud couldn't even sort a
>> list of first-last names using C.
>>
>> You're his 2nd cola groupie (Slimer was his first).  You should have
>> more self-esteem.

I don't know why you're smitten with the lying, hostile wackjob.

>>> There was also a 13 or so year old kid in the classroom sitting with
>>> his father, and asking most of the questions! One of those who even
>>> in middle school knew how to program well and had a talent for it.
>>
>> eh?  Not long ago you insisted over and over, directly to me, that
>> good programming skills doesn't require talent.
>>
>> You've been sucking up to Feeb too much.
>>
>>
>
>
> So Farley has enthusiasm. What's wrong with that? In a usenet setting it
> is great to have enthusiasm.

You're mistaking mental illness and extreme insecurity for enthusiasm.

> Talk is cheap,

Yes it is, and Feeb's talk is the cheapest on cola.

> he solved some of the problems I posed, and you and
> others didn't.

I've had you killfiled for months.

> That's what matters. He also proposed some problems and
> none of you could answer. That counts a lot. He's alive, you guys are
> half dead. Some among you are stone dead! Totally dysfunctional.

The group is comp.os.linux.advocacy, not comp.solve.math.problems. I
like to write small programs in C and python, so some of these problems
appeal to me (if I happen to see them).

> Your answer to this latest problem is plain wrong. This far, you're not
> even a code monkey. Sorry.

Doubling down on your idiocy? My last answer is 100% correct, and it is
"completely invalid PhysFit problem that cannot be answered". Probably
it's your English, and that bogus story. You were much more concerned
with the homoerotic fantasy and the gold coins than formulating a valid
problem.

With random pieces and random placement of the pieces, you can never
know beforehand how many possible moves will be available.

> Do you have a music background?

No, but I sense you play the skin flute.