Live briefing
Everything about Alpha–beta pruning
Search algorithm
Alpha–beta pruning is a tree 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 combinatorial games. It stops 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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Alpha–beta pruningA 5-minute orientation
- Skim a recent paper: Alpha evolution: An efficient evolutionary algorithm with evolution path adaptation and matrix generationInfluential work since 2022
- Pick up a classic book: Software EngineeringThe most-reprinted book on the subject
- Read the landmark paper: A minimax algorithm better than alpha-beta?Cited 119 times
- Go sideways: Principal variation searchA closely related topic
- Go sideways: NegamaxA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A minimax algorithm better than alpha-beta?
Alpha-EIOU-YOLOv8: An Improved Algorithm for Rice Leaf Disease Detection
A stability constrained adaptive alpha for gravitational search algorithm
An algorithm for the solid angle calculation applied in alpha-particle counting
On the branching factor of the alpha-beta pruning algorithm
A minimax algorithm better than alpha-beta? Yes and No
Algorithm for rapid reconstruction of protein backbone from alpha carbon coordinates
A parallel alpha/beta tree searching algorithm
🆕 Influential since 2022
Alpha evolution: An efficient evolutionary algorithm with evolution path adaptation and matrix generation
A higher prediction accuracy–based alpha–beta filter algorithm using the feedforward artificial neural network
A new $ \alpha $-robust nonlinear numerical algorithm for the time fractional nonlinear KdV equation
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes
ALPHA: A Novel Algorithm-Hardware Co-Design for Accelerating DNA Seed Location Filtering
📚 Books worth reading
Software EngineeringRoger S. Pressman, Bruce Maxim · 1982
Artificial intelligenceStuart J. Russell, Peter Norvig · 1994- 📕Handbook of exchange ratesLucio Sarno, Jessica James · 2012
Parallel Programming in C with MPI and OpenMPMichael J. Quinn · 2003
GlaucomaCarlo Nucci · 2008
BioinformaticsN. Gautham · 2006
Data mining methodsRajan Chattamvelli · 2009- 📕AntidepressantsS. M. Stahl · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Principal variation search Principal variation search (sometimes equated with the practically identical NegaScout) is a negamax algorithm that can be faster than alpha–beta pruning…
- Negamax Negamax search is a variant form of minimax search that relies on the zero-sum property of a two-player game. This algorithm relies on the fact that min(a…
- Expectiminimax The expectiminimax algorithm is a variation of the minimax algorithm, for use in artificial intelligence systems that play two-player zero-sum games, such…
- Best node search Best node search (BNS), originally known as fuzzified game tree search, is a minimax search algorithm developed in 2011 that optimizes decision-making…
- Glossary of computer chess terms The glossary of computer chess terms explains commonly used terms in computer chess, in alphabetical order. For terms used in chess in general, see Glossary…
- Move ordering Move ordering refers to the practice of selecting the most promising moves first during game-tree search (especially in computer chess). In minimax searches…
- Minimax Minimax (sometimes Minmax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, combinatorial game theory, statistics…
- MTD(f) MTD(f) is an alpha-beta game tree search algorithm modified to use ‘zero-window’ initial search bounds, and memory (usually a transposition table) to reuse…