Author: Greg Simpson
Date: 16:18:57 01/02/06
Go up one level in this thread
On January 02, 2006 at 17:39:45, Thomas Mayer wrote: >Hi Greg, > >> So is it possible to store the results for 2^157 positions? > >[...] > >> This might be theoretically doable sometime in the future, but no one would >> ever bother doing it. > >well, I doubt that it is doable. I once read that there are about as many >possible game-positions as atoms in the universe. If that is true, it's never >solveable as long the universe does not get some more atoms for the >tablebase-generator-program... :) >Because somehow the fifty-move counter must be a part of a position, you know >some positions might be mate, but only if the fifty-move counter is not bigger >then a special number. > >Besides that -> a friend of mine gave me an explanation why the simulation-idea >of our life in the movie matrix is unlikely. Let's expect that you need more >then one atom to simulate one atom. Therefor a simulation of such a big thing >like the universe and how it is presented to us is VERY unlikely. I think this >is a very reasonable explanation. > >Greets, Thomas Did you read the link Uri posted? It says that there are less than 2^157 (about 2x10^47) possible chess positions that can occur in a game. This is far less that the roughly 10^79 atoms in the universe. When I've seen the bit about the number of positions in chess being greater than the number of atoms its always been a simple calculation like 20 moves per position and 80 plys in a 40 move game equals 10^104 positions to analyze. The problem with this is it ignores a truly staggering number of transpositions!
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.