Author: Stefano Gemma
Date: 13:42:49 08/03/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. ... The problem is that you cannot "solve" chess in a usefull way. Even if you can get the score for any position in one year or two, then you have to store it, somewhere, and search for it, when it is your time to move. You have to do it for any position, not just the best ones. So, if someone could solve chess, he can only say "the first best move is ...", "the first best answer is..." and so on. You can just play a less best move, to make the other player search in a database that is to big for any computer... now and in the future. IMHO, obviously ;) Stefano
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.