Abstract
The strength of the current generation of chess programs is strongly correlated with their search speed. Thus, any improvement in the efficiency of the tree search usually results in a stronger program. Here we describe a technique, called the null-move heuristic, that can be effectively used to improve search speed with only a small chance of error. Although the technique has been previously used in specialized programs for chess tactics, this chapter describes an implementation suitable for general chess programs.
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
Goetsch, G., Campbell, M.S. (1990). Experiments with the Null-Move Heuristic. 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_9
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9080-0_9
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