Experiments with the Null-Move Heuristic

  • G. Goetsch
  • M. S. Campbell
Conference paper


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.


Horizon Effect Search Tree Legal Move Search Effort Search Window 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 1990

Authors and Affiliations

  • G. Goetsch
  • M. S. Campbell

There are no affiliations available

Personalised recommendations