Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are　uated by the minimax algorithm in its search tree. It is an adversarial search algorithm used commonly for machine playing of two-player games (Tic-tac-toe, Chess, Go, etc.).