Skip to search formSkip to main contentSkip to account menu

Null-move heuristic

Known as: Null-move pruning, Verified null-move pruning 
In computer chess programs, the null-move heuristic is a heuristic technique used to enhance the speed of the alpha-beta pruning algorithm.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
In this paper we introduce a novel method for automatically tuning the search parameters of a chess program using genetic…