Corpus ID: 7894372

An Analysis of Alpha-Beta Priming '

@inproceedings{Knuth2002AnAO,
  title={An Analysis of Alpha-Beta Priming '},
  author={D. Knuth and Ronald W. Moore},
  year={2002}
}
The alpha-beta technique for searching game trees is analyzed, in an attempt to provide some insight into its behavior. The first portion o f this paper is an expository presentation o f the method together with a proof o f its correctness and a historical ch'scussion. The alpha-beta procedure is shown to be optimal in a certain sense, and bounds are obtained for its running time with various kinds o f random data. Put one pound of Alpha Beta Prunes in a jar or dish that has a cover. Pour one… Expand

Figures and Tables from this paper

References

SHOWING 1-10 OF 13 REFERENCES
Analysis of the alpha-beta pruning algorithm
Some Studies in Machine Learning Using the Game of Checkers
  • A. Samuel
  • Computer Science
  • IBM J. Res. Dev.
  • 1959
Structured Programming with go to Statements
Chess-Playing Programs and the Problem of Complexity
The Greenblatt chess program
Branch-and-Bound Methods: A Survey
...
1
2
...