OT: Re: A single integer N = a complete chess game

[Ralf Stephan]

Me wrote 
> Now with a theoretical maximum of 5000? moves (in practice 200
> but with the new endgame rules there's more possible) your number
> is less than 2^200, but certainly less than 2^5000 or so.
> That is, about 30 and 1500 digits, respectively.

Stop! This should have read 176^400 and 900 digits for 400 half
moves each having 176 possibilities. 2^8^400 and 980 digits for
the variant having one byte per half move. And the other scheme
had not 18 but 14 bit, so for 400 half moves the number N grows
to (2^14)^400 and 1700 digits.

If you set moves to 0 which weren't done than, as most games are
only 40 to 60 moves long, the number shouldn't grow beyond much
more than 200 digits.


ralf