Abstract
In this paper a theory of game tree algorithms is presented, entirely based upon the concept of a solution tree. Two types of solution trees are distinguished: max and min trees. Every game tree algorithm tries to prune as many nodes as possible from the game tree. A cut-off criterion in terms of solution trees will be formulated, which can be used to eliminate nodes from the search without affecting the result. Further, we show that any algorithm actually constructs a superposition of a max and a min solution tree. Finally, we will see how solution trees and the related cutoff criterion are applied in major game tree algorithms like alphabeta and MTD.
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.
Similar content being viewed by others
References
Bobrow, D.: Artificial Intelligence in perspective, a retrospective on fifty volumes of the Artificial Intelligence Journal. Artificial Intelligence, 59:5–20, ISSN 0004-3702, 1993.
de Bruin, A., Pijls, W., Plaat, A.: Solution Trees as a Basis for Game Tree Search. ICCA Journal, 17(4): 207–219, ISSN 0920-234X, 1994.
Finkel, R.A., Fishburn, J.P. Parallelism in alpha-beta search. Artificial Intelligence, 19:89–106, ISSN 0004-3702, 1982.
Ibaraki, T.: Generalization of alpha-beta and SSS* search procedures. Artificial Intelligence, 29:73–117, ISSN 0004-3702, 1986.
Kumar, V., Kanal, L.N.: A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures. Artificial Intelligence, 21:179–198, ISSN 0004-3702, 1983.
Knuth D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artificial Intelligence, 6:293–326, ISSN 0004-3702, 1975.
Pijls, W., de Bruin, A.: Game tree algorithms and solution trees. Technical Report EUR-CS-98-02, Erasmus University Rotterdam, 1998, available as: http://www.cs.few.eur.nl/few/inf/publicaties/rapporten.eur-few-cs-98-02.ps
Plaat, A., Schaeffer, J., Pijls, W., de Bruin, A.: A Minimax Algorithm Better than SSS*. Artificial Intelligence, 84:299–337, ISSN 0004-3702, 1996.
Stockman, G. A minimax algorithm better than alpha-beta? Artificial Intelligence, 12:179–196, ISSN 0004-3702, 1979.
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
Pijls, W., de Bruin, A. (1999). Game Tree Algorithms and Solution Trees. 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_12
Download citation
DOI: https://doi.org/10.1007/3-540-48957-6_12
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