Alpha–beta pruning
Poda alfa-beta
- Date
- 1956-1963 · confidence low
- Place
- Moscow, Russia
- Credited to
- Alexander Brudno y Arthur L. Samuel
- Field
- Knowledge & symbols
⚠️ Disputed: the sources disagree.
What it is
Alpha-beta pruning, which avoids evaluating search-tree branches that cannot influence minimax's final decision, arose independently in the late 1950s — with an early version by Arthur Samuel for checkers — and was fully described in 1963 by Soviet researcher Alexander Brudno.
Several researchers reached similar versions independently (Samuel, McCarthy and his students, Brudno); Brudno's complete 1963 description is used as the reference point, though precedents exist from the late 1950s in the United States.
What it led to
- Computer chess and checkers engines
- Game-tree search optimization
- Zero-sum game AI algorithms