Alpha-beta pruning is a search optimization algorithm that removes game-tree branches that cannot change the selected minimax evaluation. By evaluating fewer nodes, a chess program can examine deeper move sequences within a time limit. section 7.1
The technique addresses a practical constraint: stronger moves may require more computation, but spending too long on one turn leaves less time for later decisions. Pruning therefore works alongside heuristics that estimate the advantages of positions. section 7.1
Chess search
Chess programs use alpha-beta pruning to reduce the nodes evaluated while analyzing many possible move sequences. Systems such as Deep Blue combine this search reduction with positional heuristics, grandmaster-game databases, opening sequences, and endgame data. section 7.1
