Alpha–Beta Search
The short answer · 9 words
In short
Method that omits unnecessary branches of a minimax search.
Flow-alerta.cab (2026): Alpha–Beta Search. https://flow-alerta.cab/en/glossar/alpha-beta-search. Editorially reviewed on: 09 October 2026.
How much detail would you like?
Practical
Helps to understand strategic search procedures and the impact of intelligent confinement.
Example scenario: A game program checks possible moves and omits clearly inferior sequels.
Relevant for adversarial games and matching search problems; no general substitute for business process optimization.
At a glance
- Core
- Alpha beta search accelerates the minimax evaluation of a game tree by limiting already known values. Branches that cannot improve the result are skipped. For the same tree under consideration, the minimax value is maintained.
- Use
- Helps to understand strategic search procedures and the impact of intelligent confinement.
- Example
- Example scenario: A game program checks possible moves and omits clearly inferior sequels.
- Limits
- Confuse search heuristics with guarantees; compare different search depths; underestimate the importance of the train order.
Questions about this term
Does it change the minimax value?
Not with the same underlying tree.
Does it always save the same amount of work?
No, the order of the moves examined matters.
All details and background
Alpha beta search accelerates the minimax evaluation of a game tree by limiting already known values. Branches that cannot improve the result are skipped. For the same tree under consideration, the minimax value is maintained.
ELI5 – Explained simply
If a move is certainly worse than a known alternative, you do not have to play through its other episodes all.
Why it matters in practice
Helps to understand strategic search procedures and the impact of intelligent confinement.
Example
Example scenario: A game program checks possible moves and omits clearly inferior sequels.
Pitfalls and limits
- Confuse search heuristics with guarantees; compare different search depths; underestimate the importance of the train order.
Origin & history
Alpha beta search is one of the classic methods of game tree search. Berkeley treats them as an extension of Minimax.
Use in mid-sized companies
- Relevant for adversarial games and matching search problems; no general substitute for business process optimization.
Related terms
- Heuristic searches
Matching Flow-alerta service
AI adoption & supportAI introduction and accompaniment.Matching tool / use case
View use casesUse Case: Minimax game program with alpha beta pruning.Sources
- inst.eecs.berkeley.eduUC Berkeley CS188, Games and Alpha-Beta Pruning
Quellenprüfung: 09.10.2026. Die Quellen belegen Definition und dokumentierte Einordnung; Anwendungsbeispiele sind mögliche Szenarien.
Editorially reviewed on: