Author: Gian-Carlo Pascutto
Date: 10:36:51 06/02/02
Go up one level in this thread
On June 02, 2002 at 13:32:46, GuyHaworth wrote: > >Nothing special about 5, 6 ... or 32. > >If you assume unbounded resources of memory and time, you can 'solve chess' - >as Zermelo proved. > >Actually, there are some reservations about whether Zermelo's proof was ok, but >I haven't got to the bottom of that yet. > >I do have a problem about the 'infinite memory' though. If Chess has more >positions than there are atoms in the universe ... and if it needs one atom per >bit of memory, we will have a slight problem storing the entire set of position >values, compression notwithstanding. You don't need to store every position to 'solve' chess. If just win/loss/draw and the move to reach it is enough, a small and finite amount of RAM will do. -- GCP
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.