Abstract
In this paper the basic ideas of a new, flexible and knowledge-intensive algorithm for game tree search are outlined. A quick selection is made by filtering out the most promising part of a usually large game tree (in the discovery phase). This partial tree can be examined afterwards in a more intensive way (in the decision phase). Notable features of the algorithm are a method for the suitable expansion of the search tree, means for a finegrained evaluation of uncertainties and a basis for well-founded decisions.
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
Anantharaman, T., Campbell, M., and Hsu, F., Singular Extensions: Adding Selectivity to Brute-Force Searching, in Proceedings of the AAAI Spring Symposium on Computer Game Playing, Palo Alto, CA, March, 1988.
Berliner, H., The B Tree Search Algorithm: A Best-First Proof Procedure, Artificial Intelligence 12 (1), 1979, 23 - 40.
De Groot, A., Thought and Choice in Chess. Mouton, The Hague, 1965.
Horacek, H., Kaindl, H., and Wagner, M., Decision Making in Unclear Situations, in Proceedings 10. GWAI und 2. Osterreichische AI-Tagung 1986, Ottenstein, September, 1986, 17–27.
Horacek, H. Reasoning with Uncertainty in Computer Chess, to appear in Artificial Intelligence Journal, Special Issue on Computer Chess, Berliner H. (ed.) 1989, and in Advances in Computer Chess 5, Beal D. (ed.),Noorwijkerhout, Netherlands, April 1987.
Kaindl, H., Dynamic Control of the Quiescence Search in Computer Chess, in Proceedings EMCSR-82, Vienna, April, 1982, 973–978.
Kaindl, H., Searching to Variable Depth in Computer Chess, in Proc. IJCAI 83, Karlsruhe, August, 1983, 760 - 762.
Knuth, D., and Moore, R., An Analysis of Alpha-Beta Pruning, Artificial Intelligence 6 (4), 1975, 293 - 326.
Palay, A., Searching with Probabilities. PhD thesis, Carnegie-Mellon Univ., May, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Horacek, H., Kaindl, H. (1989). An Outline of a New Algorithm for Game Tree Search. In: Retti, J., Leidlmair, K. (eds) 5. Österreichische Artificial-Intelligence-Tagung. Informatik-Fachberichte, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-74688-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-74688-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51039-0
Online ISBN: 978-3-642-74688-8
eBook Packages: Springer Book Archive