Null-move heuristic

From Wiki @ Karl Jones dot com
Revision as of 09:52, 29 August 2016 by 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...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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

Retrieved from "http://wiki.karljones.com/index.php?title=Null-move_heuristic&oldid=17447"