Abstract
When the search tree is large it must be truncated. We may truncate near the root or further away. We can do the latter if the tree is narrow (Fig. 5). In a wide tree we must truncate near the initial position, i.e., the limiting depth of the variations is small.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Botvinnik, M.M. (1984). Methods of Limiting the Search Tree. In: Computers in Chess. Symbolic Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-5204-7_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5204-7_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9736-9
Online ISBN: 978-1-4612-5204-7
eBook Packages: Springer Book Archive