Author: George Tsavdaris
Date: 15:42:51 06/19/03
Go up one level in this thread
On June 19, 2003 at 16:20:06, Uri Blass wrote: >On June 19, 2003 at 15:13:43, Terry Giles wrote: > >> >>A poser (just for fun) >> >>The perfect chess-playing machine 'Quantum-Chess' amazingly resigned its first >>game after only twenty moves in its match against the current human world >>champion Kay Sar. The Japanese GM opened the game with her favourite g4 and >>after reaching an interesting and apparently equal position ‘Quantum-Chess' >>promptly resigned. >> >>Question: Assuming the machine really can play perfect chess, and Kay Sar (3015 >>elo) cannot, why did ‘Quantum-Chess’ resign? > >The reason is that Quantum-chess needs to search deep enough in order to play >perfect chess and it was unable to do it in the game because it had not >9^9^9^9^9^9 years per move. > Off Topic but 9^9^9 is equal to: a)9^(9^9) = 9^387420489 or b)(9^9)^9 = 387420489^9 a) is much much bigger than b).
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.