Editing Null-move heuristic (section)

== Rationale ==

[[Alpha–beta pruning]] speeds the [[minimax algorithm]] by identifying ''cutoffs'', points in the [[game tree]] where the current position is so good for the side to move that best play by the other side would have avoided it.  Since such positions could not have resulted from best play, they and all branches of the game tree stemming from them can be ignored.  The faster the program produces cutoffs, the faster the search runs. The null-move heuristic is designed to guess cutoffs with less effort than would otherwise be required, whilst retaining a reasonable level of accuracy.

The null-move heuristic is based on the fact that most reasonable chess moves improve the position for the side that played them.  So, if the player whose turn it is to move can forfeit the right to move (or make a [[null move]] – an illegal action in [[chess]]) and still have a position strong enough to produce a cutoff, then the current position would almost certainly produce a cutoff if the current player actually moved.