# Alpha–beta pruning

{{#invoke:Hatnote|hatnote}} Template:Tree search algorithm

**Alpha–beta pruning** is a search algorithm that seeks to decrease the number of nodes that are evaluated 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.). It stops completely evaluating a move when at least one possibility has been found that proves the move to be worse than a previously examined move. Such moves need not be evaluated further. When applied to a standard minimax tree, it returns the same move as minimax would, but prunes away branches that cannot possibly influence the final decision.^{[1]}

## Contents

## History

Allen Newell and Herbert A. Simon who used what John McCarthy calls an "approximation"^{[2]} in 1958 wrote that alpha–beta "appears to have been reinvented a number of times".^{[3]} Arthur Samuel had an early version and Richards, Hart, Levine and/or Edwards found alpha–beta independently in the United States.^{[4]} McCarthy proposed similar ideas during the Dartmouth Conference in 1956 and suggested it to a group of his students including Alan Kotok at MIT in 1961.^{[5]} Alexander Brudno independently discovered the alpha–beta algorithm, publishing his results in 1963.^{[6]} Donald Knuth and Ronald W. Moore refined the algorithm in 1975^{[7]}^{[8]} and Judea Pearl proved its optimality in 1982.^{[9]}

## Improvements over naive minimax

The benefit of alpha–beta pruning lies in the fact that branches of the search tree can be eliminated. This way, the search time can be limited to the 'more promising' subtree, and a deeper search can be performed in the same time. Like its predecessor, it belongs to the branch and bound class of algorithms. The optimization reduces the effective depth to slightly more than half that of simple minimax if the nodes are evaluated in an optimal or near optimal order (best choice for side on move ordered first at each node).

With an (average or constant) branching factor of *b*, and a search depth of *d* plies, the maximum number of leaf node positions evaluated (when the move ordering is pessimal) is *O*(*b***b**...**b*) = *O*(*b*^{d}) – the same as a simple minimax search. If the move ordering for the search is optimal (meaning the best moves are always searched first), the number of leaf node positions evaluated is about *O*(*b**1**b**1*...**b*) for odd depth and *O*(*b**1**b**1*...*1) for even depth, or . In the latter case, where the ply of a search is even, the effective branching factor is reduced to its square root, or, equivalently, the search can go twice as deep with the same amount of computation.^{[10]} The explanation of *b**1**b**1*... is that all the first player's moves must be studied to find the best one, but for each, only the best second player's move is needed to refute all but the first (and best) first player move—alpha–beta ensures no other second player moves need be considered. When nodes are ordered at random,
the average number of nodes evaluated is roughly
.^{[2]}

Normally during alpha–beta, the subtrees are temporarily dominated by either a first player advantage (when many first player moves are good, and at each search depth the first move checked by the first player is adequate, but all second player responses are required to try to find a refutation), or vice versa. This advantage can switch sides many times during the search if the move ordering is incorrect, each time leading to inefficiency. As the number of positions searched decreases exponentially each move nearer the current position, it is worth spending considerable effort on sorting early moves. An improved sort at any depth will exponentially reduce the total number of positions searched, but sorting all positions at depths near the root node is relatively cheap as there are so few of them. In practice, the move ordering is often determined by the results of earlier, smaller searches, such as through iterative deepening.

The algorithm maintains two values, alpha and beta, which represent the maximum score that the maximizing player is assured of and the minimum score that the minimizing player is assured of respectively. Initially alpha is negative infinity and beta is positive infinity, i.e. both players start with their lowest possible score. It can happen that when choosing a certain branch of a certain node the minimum score that the minimizing player is assured of becomes less than the maximum score that the maximizing player is assured of (beta<=alpha). If this is the case, the parent node should not choose this node, because it will make the score for the parent node worse. Therefore, the other branches of the node do not have to be explored.

Additionally, this algorithm can be trivially modified to return an entire principal variation in addition to the score. Some more aggressive algorithms such as MTD(f) do not easily permit such a modification.

## Pseudocode

01functionalphabeta(node, depth, α, β, maximizingPlayer) 02ifdepth = 0ornode is a terminal node 03returnthe heuristic value of node 04ifmaximizingPlayer 05 v := -∞ 06for eachchild of node 07 v := max(v, alphabeta(child, depth - 1, α, β, FALSE)) 08 α := max(α, v) 09ifβ ≤ α 10break(* β cut-off *)11returnv 12else13 v := ∞ 14for eachchild of node 15 v := min(v, alphabeta(child, depth - 1, α, β, TRUE)) 16 β := min(β, v) 17ifβ ≤ α 18break(* α cut-off *)19returnv

alphabeta(origin, depth, -∞, +∞, TRUE)(* Initial call *)

## Heuristic improvements

Further improvement can be achieved without sacrificing accuracy, by using ordering heuristics to search parts of the tree that are likely to force alpha–beta cutoffs early. For example, in chess, moves that take pieces may be examined before moves that do not, or moves that have scored highly in earlier passes through the game-tree analysis may be evaluated before others. Another common, and very cheap, heuristic is the killer heuristic, where the last move that caused a beta-cutoff at the same level in the tree search is always examined first. This idea can be generalized into a set of refutation tables.

Alpha–beta search can be made even faster by considering only a narrow search window (generally determined by guesswork based on experience). This is known as *aspiration search*. In the extreme case, the search is performed with alpha and beta equal; a technique known as *zero-window search*, *null-window search*, or *scout search*. This is particularly useful for win/loss searches near the end of a game where the extra depth gained from the narrow window and a simple win/loss evaluation function may lead to a conclusive result. If an aspiration search fails, it is straightforward to detect whether it failed *high* (high edge of window was too low) or *low* (lower edge of window was too high). This gives information about what window values might be useful in a re-search of the position.

## Other algorithms

More advanced algorithms that are even faster while still being able to compute the exact minimax value are known, such as SCOUT,^{[11]} Negascout and MTD-f.

Since the minimax algorithm and its variants are inherently depth-first, a strategy such as iterative deepening is usually used in conjunction with alpha–beta so that a reasonably good move can be returned even if the algorithm is interrupted before it has finished execution. Another advantage of using iterative deepening is that searches at shallower depths give move-ordering hints, as well as shallow alpha and beta estimates, that both can help produce cutoffs for higher depth searches much earlier than would otherwise be possible.

Algorithms like SSS*, on the other hand, use the best-first strategy. This can potentially make them more time-efficient, but typically at a heavy cost in space-efficiency.^{[12]}

## See also

## References

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- Judea Pearl,
*Heuristics*, Addison-Wesley, 1984

- ↑ {{#invoke:citation/CS1|citation |CitationClass=book }}
- ↑
^{2.0}^{2.1}Template:Cite web - ↑ {{#invoke:Citation/CS1|citation |CitationClass=journal }}
- ↑ Template:Cite web
- ↑ Template:Cite web
- ↑ Template:Cite web
- ↑ * {{#invoke:Citation/CS1|citation
|CitationClass=journal
}}
- Reprinted as Chapter 9 in {{#invoke:citation/CS1|citation

- ↑ {{#invoke:Citation/CS1|citation |CitationClass=journal }} Template:Dead link
- ↑ {{#invoke:Citation/CS1|citation |CitationClass=journal }}
- ↑ Template:Russell Norvig 2003
- ↑ Pearl, J., "SCOUT: A Simple Game-Searching Algorithm With Proven Optimal Properties,"
*Proceedings of the First Annual National Conference on Artificial Intelligence,*Stanford University, August 18–21, 1980, pp. 143-145. - ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}

## External links

- http://www.emunix.emich.edu/~evett/AI/AlphaBeta_movie/sld001.htm
- http://sern.ucalgary.ca/courses/CPSC/533/W99/presentations/L1_5B_McCullough_Melnyk/
- http://sern.ucalgary.ca/courses/CPSC/533/W99/presentations/L2_5B_Lima_Neitz/search.html
- http://www.maths.nott.ac.uk/personal/anw/G13GAM/alphabet.html
- http://chess.verhelst.org/search.html
- http://www.frayn.net/beowulf/index.html
- http://hal.inria.fr/docs/00/12/15/16/PDF/RR-6062.pdf
- Minimax (with or without alpha–beta pruning) algorithm visualization - game tree solving (Java Applet), for balance or off-balance trees
- Demonstration/animation of minimax game search algorithm with alpha–beta pruning (using html5, canvas, javascript, css)

{{#invoke: Navbox | navbox }}