Author: Dann Corbit
Date: 17:28:47 12/10/02
Go up one level in this thread
On December 10, 2002 at 20:16:25, Anthony Cozzie wrote: [smip] >This (while probably correct) is not the question. He is looking for an >ALGORITHM. For example, the game Hex can also be played with alpha-beta search, >but there is an algorithm that, when followed will always allow white to win. >In other words, he is looking for some sort of static analysis of the chessboard >with some rules that, when followed, will allow white to always win or black to >always draw. I don't think a chess algorithm exists, but hey, you never know :) The algorithm is called minimax, amplified by alpha-beta search, and is very well known. A material only search will definitely solve it. Better yet, a proof number search will solve it. You'll just have to wait for a while. The algorithm is not the problem. The exponential nature of the algorithm is the problem.
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.