Author: Heiner Marxen
Date: 12:43:29 02/17/00
Go up one level in this thread
On February 17, 2000 at 14:45:24, Larry Oliver wrote: >It is no doubt possible that, with say a two move look ahead, a position could >be reached where one best next move has the exact same evaluation as one or more >others. What does the computer do in such a case, toss a coin? > >Is it possible that a position could be reached that has two or more moves that >are evaluated as exactly equal after a twenty move, fifty move, two hundred move >look ahead? Sure, especially in theoretically drawn positions. >Could a position exist for which two or more moves were evaluated equal after a >number of look aheads that was equal to the number of known particles in the >universe on which to store the evaluations? > >If such is the case can a computer in theory ever play the perfect chess game? Yes, a computer can play perfectly with those 32 piece endgame tables. While they are large, their size is finite. ;-) Heiner
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.