Author: George Tsavdaris
Date: 14:49:43 01/20/05
Go up one level in this thread
On January 20, 2005 at 14:59:00, Randall Shane wrote: >On January 20, 2005 at 12:55:37, chandler yergin wrote: > >> >>To 'solve' Chess cannot be proven, until the Chess Tree of all Possible >>moves in an average game of chess have been examined. This has been shown to >>be 10^120th Power. Far exceeding the number of molecules in the observable >>universe. >> >>Would you agree? Randall you put it perfect: "It may have to examine 10^120 positions along the way, but it doesn't have to memorize them." That solves everything! Chandler don't you agree........? And another example that solve everything, since you didn't like this with Connect 4: Suppose we have a game of NIM that consist of 10^300 piles and each pile has 10^300 matches. And white playes first. This game has even more positions than Chess. But i can show you the solution altough i'm living inside this small universe......Can you figure out why...........? I haven't stored all these positions anywhere but i still can solve it..................
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.