Author: Komputer Korner
Date: 05:46:21 07/28/98
Go up one level in this thread
On July 28, 1998 at 06:00:48, blass uri wrote: > >On July 28, 1998 at 04:59:32, Terry Godat wrote: > >> I recall reading in a Guinness book devoted exclusively to chess records that >>the number of possible forty-move games is 25 times 10 to the 116th power. This >>is a number astronomically higher than the estimated number of electrons in the >>Universe. >how can they compute it? >It seem impossible to me practically to prove that the number of possible >games of forty moves is between x to 10 times x for some x. >and if this it the case why you say 25 times 10 to the 116th power and not 115 >or 117power. > >The question is what is the best lower bound and the best upper bound >someone can prove for this problem. > >another question is to find an upper bound and a lower bound for the number >of legal positions in chess. > >Uri The number of legal positions is the most important stat as far as computers are concerned. 10^42 has been put as a lower bound with 10^60 as an upper bound. I am not sure as to the mathematical accuracy of these though. -- Kopmputer Korner
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.