Project Sherlock

Paper

1975

An Analysis of Alpha-Beta Pruning

Donald E. Knuth & Ronald W. Moore

Proves alpha-beta pruning explores the minimum possible number of nodes to find a game tree's minimax value under best-case move ordering, and analyses how far real move ordering falls short of that bound.

Read it

Before you start

FreeAdvancedlink checked 17 Sept 2026

If this is the wrong level

Too hard? Start hereMIT 6.034 Artificial IntelligencePatrick Winston (MIT OpenCourseWare), 2010The symbolic AI curriculum as it stood before deep learning displaced it — search, constraints, representation and learning — and still the clearest account of why representation is the hard part.

Filed under Classical & Symbolic AI in Artificial Intelligence.