Author: Bruce Moreland
Date: 14:18:14 08/01/99
Go up one level in this thread
On August 01, 1999 at 17:01:34, Jeroen van Dorp wrote: >What is an alpha-beta search? Is it a parallel tree search (with parallel >processors?); a way a tree is searched or am I just talking nonsense? > >Is there a way to recognize if a program uses alpha beta search? > >Thanks for your explanation. > > >Jeroen ;-} Alpha beta search can be recognized by the fact that a program can complete more than four plies in a minute. Alpha beta is a means of safely pruning nonsense out of a chess tree. There are cases where you can decide that you don't need to search any more legal moves in a position, because you've already found one that is good enough. bruce
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.