Optimal Search on Some Game Trees

Michael Tarsi*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


It is proved that the dlrecUonal algorithm for solving a game tree is optimal, in the sense of average run trine, for balanced trees (a family containing all uniform trees). This result implies that the alpha-beta pruning method is asymptotJcally opttmal among all game searching algorithms.

Original languageEnglish
Pages (from-to)389-396
Number of pages8
JournalJournal of the ACM
Issue number3
StatePublished - 1 Jul 1983
Externally publishedYes


  • alpha-beta pruning
  • average optimal algorithms
  • game strategies

Cite this