Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: THE INEXHAUSTIBILITY OF CHESS

Author: greg moller

Date: 00:02:06 05/22/99

Go up one level in this thread


On May 21, 1999 at 14:21:28, KarinsDad wrote:

>On May 21, 1999 at 12:55:13, Dann Corbit wrote:
>
>[snip]
>>In any case, it still puts a lid on the maximum number possible.  If, for
>>instance, I can encode all chess board positions in 100 bits, then there are
>>only about 10^30 possible board positions.  The legal positions will be a
>>subset of that.  Hence, finding a minimal coding for board positions also has a
>>fascinating mathematical result: It puts a cap on the maximum number of possible
>>board positions.
>
>My estimate is 10^48 since I think that it can be done in 160 bits, but not much
>lower.
>
>KarinsDad :)

I wonder, would it be possible to generate a (random) sample of random
positions, and based on the percentage of illegal positions in that sample to
infer what the actual probability of legal/illegal would be for all positions.
Any thoughts?

regards,
gm



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.