Author: blass uri
Date: 22:20:44 03/16/00
Go up one level in this thread
On March 16, 2000 at 23:48:43, Hans Havermann wrote: >On March 16, 2000 at 10:41:56, blass uri wrote: > >>My program calculated an upper bound(ignoring things like side to move, >>50 moves rule) and found 3.7010630121207222927827147741452119115968e46 > >>Retko v.tomic found a smaller number and I do not remmeber the number >>but it was not less that 1e46. > >The estimate 64!/(32!*8!^2*2!^6) ~ 10^43 is given by Shannon in his >seminal paper "Programming a Computer for Playing Chess", Phil. Mag. >41 (1950) 256-275 (also in D. Levy's "Computer Chess Compendium"). This estimate is wrong because it assumes no promoted pieces and it assumes that pawns can be everywhere. Uri
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.