Alpha–Beta Pruning

A search-tree pruning technique applied to minimax-style adversarial search that keeps track of two bounds (alpha and beta) to eliminate branches that cannot influence the root decision, thereby reducing the number of nodes evaluated without changing the optimal minimax outcome when applied correctly.