Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,432,844 papers from all fields of science
Search
Sign In
Create Free Account
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)
Create Alert
Alert
Related topics
Related topics
6 relations
Broader (1)
Computer chess
Heuristic (computer science)
Hydra (chess)
Nathan Netanyahu
Ply (game theory)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Optimizing Selective Search in Chess
Omid David
,
Moshe Koppel
,
N. Netanyahu
arXiv.org
2010
Corpus ID: 11402208
In this paper we introduce a novel method for automatically tuning the search parameters of a chess program using genetic…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE