Abstract
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 language | English |
|---|---|
| Pages (from-to) | 389-396 |
| Number of pages | 8 |
| Journal | Journal of the ACM |
| Volume | 30 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Jul 1983 |
| Externally published | Yes |
Keywords
- alpha-beta pruning
- average optimal algorithms
- game strategies