====== Chess - Programming - History Heuristic ======

If a move from square X to square Y causes a beta-cutoff, increase a history table entry at index [sideToMove][X][Y] by some amount (this amount is typically related to the distance from the quiescence search).

When ordering moves, search moves with a higher history score before those with a lower history score.

More effective with lower search depths; at very high search depths, the heuristic produces an essentially random noise.

----


[[Chess:Programming:History Heuristic|History Heuristic]]