Abstract
Much of the work on search in artificial intelligence deals with trees. These are usually defined implicitly by a so-called problem representation, and the process of searching for a solution of the given problem can be represented by a search tree (more generally an acyclic graph, because of transpositions). For instance, in games like chess, the board positions correspond to nodes (or vertices) and the moves to directed arcs. This chapter reviews and critiques search algorithms for two-player game trees. The emphasis is on those algorithms which are currently most useful in computer-chess practice.
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.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this paper
Cite this paper
Kaindl, H. (1990). Tree Searching Algorithms. In: Marsland, T.A., Schaeffer, J. (eds) Computers, Chess, and Cognition. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9080-0_8
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9080-0_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9082-4
Online ISBN: 978-1-4613-9080-0
eBook Packages: Springer Book Archive