Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Eppstein, D.: Strategy and Board Game Programming Lecture Notes, 1997 http://www.ics.uci/~eppstein/180a/s97.html.
Plaat, A., et al: Exploiting Graph Properties of Game Trees, AAAI, 1996.
Schaeffer, J.: The History Heuristic and Alpha-Beta Enhancements in Practice, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 11, 1989.
Schaeffer, J., Plaat, A.: New Advances in Alpha-Beta Searching, Proceedings of the 24th ACM Computer Science Conference, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-45675-9_88
Download citation
DOI: https://doi.org/10.1007/3-540-45675-9_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44025-3
Online ISBN: 978-3-540-45675-9
eBook Packages: Springer Book Archive