Author: Dan Andersson
Date: 09:00:21 02/19/03
Go up one level in this thread
Current state of the art chess programs use: Alpha-Beta with memory (Hash tables) with aspiration window and nullmove pruning. Current best performing implementations are PV-Negasout and MTD(f). Quiescence search at the leaf nodes to alleviate the horizon effect. Some include checking moves in the QSearch. Some hash the QSearch positions. The search incorporates search depth extensions for certain situations like recapturing and pushing a pawn to the seventh rank. Some other kinds of pruning are sometimes used. MvH Dan Andersson
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.