Author: David Rasmussen
Date: 00:56:52 12/13/01
Go up one level in this thread
On December 12, 2001 at 23:27:58, Russell Reagan wrote: >Depth-first search is usually what is used in chess programs (at least all that >I have seen source for). What are the drawbacks of other search algorithms such >as breadth-first and best-first that prevent them from being more widely used in >chess programs? Well, the case is not so clear. Read Aske Plaat's articles about alpha-beta search enhancements and mtd(f) etc. As he states, alpha-beta minimax (which is in it self depth-first) with hashtables is really sort of a breadth first search, with every iteration of iterative deepening being a new distance class. Also, mtd-like algorithms can be made to behave like a wide selection of search algorithms (alpha-beta), SSS*, DUAL* and others. /David
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.