Abstract
Many current computer chess programs use a full-width tree search (e.g., CHESS 4.5 from Northwestern (see Chapter 4), KAISSA from the Institute of Control Science, Moscow [2], and TECH II from MIT). Other programs, such as Berliner’s [12], attempt to perform a highly selective search using extremely sophisticated heuristics. Recent improvements in chess play have come primarily from the programs using the “brute force” procedure. In particular the Northwestern program improved markedly when its plausible move selector was replaced by a full-width search. The development of specialized computer hardware, such as the chess-specific central processor which is being developed at MIT, will further benefit this “brute-strength” approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Harris, L.R. (1977). The heuristic search: An alternative to the alpha—beta minimax procedure. In: Frey, P.W. (eds) Chess Skill in Man and Machine. Texts and Monographs in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-06239-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-06239-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-06241-8
Online ISBN: 978-3-662-06239-5
eBook Packages: Springer Book Archive