Difference between revisions of "Null-move heuristic"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "In computer chess programs, the null-move heuristic is a heuristic technique used to enhance the speed of the alpha-beta pruning algor...") |
(No difference)
|
Latest revision as of 09:52, 29 August 2016
In computer chess programs, the null-move heuristic is a heuristic technique used to enhance the speed of the alpha-beta pruning algorithm.
See also
External links
- Null-move heuristic @ Wikipedia
