Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: A math problem for the experts....

Author: Dann Corbit

Date: 14:46:49 10/01/01

Go up one level in this thread


On October 01, 2001 at 17:41:59, Roy Eassa wrote:

>On October 01, 2001 at 15:48:50, Uri Blass wrote:
>
>>My counting positions program found that
>>3.7010630121207222927827147741452119115968e46 is an upper bound when I
>>considered only the squares of the pieces and did not consider side to move,en
>>passant rule and rights to castle.
>
>
>Would it be reasonable to round this off to 3.7e46?  Or are all the extra digits
>really important?

Of course, the model might not be perfect.  For instance, does it check for all
possible illegal positions?
But because it is a counting problem, all the digits are valuable.  The number
reported is the exact count made by Uri's model.

Also, what about this:
[D]rnqbkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNQBKBNR w KQkq -

It can't occur in a normal chess game, but I don't see any particular rules that
are violated [except maybe how to set up the board].




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.