Author: Robert Hyatt
Date: 09:56:31 12/24/00
Go up one level in this thread
On December 24, 2000 at 02:58:19, Uri Blass wrote: >On December 23, 2000 at 18:41:53, Joshua Lee wrote: > >>Chances are against ever solving chess let alone calculating over 10^120 > > >Programs do not need to calculate over 10^120 in order to be unbeatable in games >when the opponent is not important. > >Uri I disagree. to be "unbeatable" the program will _have_ to see to the end of the game. Anything less leaves the opportunity for an unseen loss.
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.