Alpha-Beta Search Revisited
- First Online:
- Cite this paper as:
- Parkins P., Keane J.A. (2002) Alpha-Beta Search Revisited. In: Yin H., Allinson N., Freeman R., Keane J., Hubbard S. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2002. IDEAL 2002. Lecture Notes in Computer Science, vol 2412. Springer, Berlin, Heidelberg
An algorithm, Aspiration Scout/MTD(f), is derived from an analysis of alpha-beta (α-β) tree search. When compared to its predecessors, it results in an average 10.1% reduction in search effort with a best case of 17.4%. 1 The search space is usually referred to as a tree, however in games such as chess and draughts it is actually a directed acyclic graph (DAG). Programs search a dynamically unfolding DAG.
Unable to display preview. Download preview PDF.