Null-move pruning

A null move is an artificial pass used only inside the calculation of a chess engine, a program that analyzes positions. The side to move gives up a turn without moving a piece and lets the opponent act. This pass is not legal in an actual chess game. It serves as a quick test of how robust the position is.

The engine performs that test with a reduced search, meaning one that looks fewer moves ahead than the normal search. If the position still clearly exceeds the required cutoff threshold after giving the opponent a free turn, the program assumes that at least one legal move will also be sufficient. It can then stop that branch without checking every choice individually.

This pruning saves substantial work, but its assumption is not universally valid. In zugzwang, making a move is harmful and being allowed to pass would be an advantage that real chess does not provide. The null-move test may label a position safe even though it is lost because the player must move. The risk is greater in some low-material endings.

Engines therefore add safeguards. They do not use the test while the king is in check, and they may disable it when little material remains, use a less aggressive reduction, or run a verification search before accepting the cutoff. Null-move pruning operates inside frameworks such as minimax and combines with other selection techniques, but it does not decide the best move by itself.