Abstract
The efficiency of the αβ-algorithm as a minimax search procedure can be attributed to its effective pruning at so called cut-nodes; ideally only one move is examined there to establish the minimax value. This paper explores the benefits of investing additional search effort at cut-nodes by expanding other move alternatives as well. Our results show a strong correlation between the number of promising move alternatives at cut-nodes and a new principal variation emerging. Furthermore, a new forward pruning method is introduced that uses this additional information to ignore potentially futile subtrees. We also provide experimental results with the new pruning method in the domain of chess.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
T. Anantharaman. A Statistical Study of Selective Min-Max Search in Computer Chess. PhD thesis, Carnegie-Mellon University, Pittsburgh, PA, May 1990.
T. Anantharaman, M. S. Campbell, and F. Hsu. Singular extensions: Adding selectivity to brute-force searching. Artificial Intelligence, 43(1):99–109, 1990.
D. E. Knuth and R. W. Moore. An analysis of alpha-beta pruning. Artificial Intelligence, 6(4):293–326, 1975.
T. A. Marsland. Single-Agent and Game-Tree Search. In A. Kent and J. G. Williams, editors, Encyclopedia of Computer Science and Technology, volume 27, pages 317–336, New York, 1993. Marcel Dekker, Inc.
D. A. McAllester and D. Yuret. Alpha-beta-conspiracy search, 1993. URL: http://www.research.att.com/~dmac/abc.ps.
D. S. Nau. Pathology on game trees: A summary of results. In Proceedings of the ACM National Conference on Artificial Intelligence, pages 102–104, 1980.
A. Reinefeld. An improvement to the Scout tree search algorithm. ICCA Journal, 6(4):4–14, 1983.
J. Schaeffer. The history heuristic and alpha-beta search enhancements in practice. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(1):1203–1212, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Björnsson, Y., Marsland, T. (1999). Multi-cut Pruning in Alpha-Beta Search. In: van den Herik, H.J., Iida, H. (eds) Computers and Games. CG 1998. Lecture Notes in Computer Science, vol 1558. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48957-6_2
Download citation
DOI: https://doi.org/10.1007/3-540-48957-6_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65766-8
Online ISBN: 978-3-540-48957-3
eBook Packages: Springer Book Archive