Null-move heuristic

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

• Alpha–beta pruning
• Computer chess
• Heuristic (computer science)

External links

• Null-move heuristic @ Wikipedia