Linked from

The 10 pages that link to Alpha–beta pruning, each with the reason it gives.

• MinimaxRelated: It computes the same minimax decision while examining fewer positions.

• Minimax theoremRelated: Game-playing algorithms use minimax reasoning to evaluate choices and prune irrelevant branches.

• Tic-tac-toeRelated: It demonstrates how search can avoid examining irrelevant moves, even when exhaustive search is feasible.

• MancalaRelated: It reduces the computation needed to search possible mancala moves.

• Computer chessRelated: It lets chess engines search deeper without evaluating every possible continuation.

• GomokuRelated: It lets Gomoku engines examine deeper lines while considering fewer moves.

• ReversiRelated: It lets Reversi programs search deeper without changing the chosen move.

• Chess theoryRelated: It lets chess engines examine deeper variations without evaluating every continuation.