Author: Pallav Nawani
Date: 09:33:33 08/02/05
Go up one level in this thread
On August 02, 2005 at 11:12:38, Eberhard wrote: >Quantum computers could solve chess in combination with alpha-beta pruning >(iterative deepening), theoretically speaking. > >These techniques each reduce the average number of branches of the game tree by >2 - and jointly the combination appears to reduce the tree size to one that >might be completed in a practical time; about 10^(50/4) ~ 10^13 positions, which >could be completed on a single computer in a year at only ~100,000 positions per >second. > >http://en.wikipedia.org/wiki/Computer_chess This information seems incorrect. Number of unique positions is not the same as search tree size. Further, quantum computing does nothing to reduce search tree size. Lastly, my chess program Natwarlal can do 240,000 positions per second on a 1Ghz PC, it also uses more advanced seach techniques than just plain alpha beta, and I don't see _any_ chance of solving chess with 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.