# An Analysis of Alpha-Beta Priming '

@inproceedings{Knuth2002AnAO, title={An Analysis of Alpha-Beta Priming '}, author={Donald Ervin 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…

## References

SHOWING 1-10 OF 24 REFERENCES

### Analysis of the alpha-beta pruning algorithm

- Computer Science
- 1973

An analytical expression for the expected number of bottom positions examined in a game tree using alpha-beta pruning is derived, subject to the assumptions that the branching factor N and the depth D of the tree are arbitrary but fixed, and the bottom positions are a random permutation of (N sub D) unique values.

### Experiments With a Multipurpose, Theorem-Proving Heuristic Program

- Computer ScienceJACM
- 1968

The heuristic program discussed searches for a constructive proof or disproof of a given proposition. It uses a search procedure which efficiently selects the seemingly best proposition to work on…

### Some Studies in Machine Learning Using the Game of Checkers

- Computer ScienceIBM J. Res. Dev.
- 1959

A new signature-table technique is described together with an improved book-learning procedure which is thought to be much superior to the linear polynomial method and to permit the program to look ahead to a much greater depth than it otherwise could do.

### Structured Programming with go to Statements

- Computer ScienceCSUR
- 1974

For serious students of structured programming, and also for language designers, Knuth's "Structured Programming with go to Statements" is probably the paper to read. It is by far the most complete…

### Chess-Playing Programs and the Problem of Complexity

- Computer ScienceIBM J. Res. Dev.
- 1958

The Los Alamos program is an almost perfect example of the type of system specified by Shannon, and the static evaluation function consisted of a sum of material and mobility measures.

### Programming a computer to play chess

- Computer Science
- 1970

The principles used in organizing and processing information in the chess programs devised by the authors during the years 1961-6 for the electronic computer M-20 are described.

### A chess playing program for the IBM 704

- Computer ScienceIRE-ACM-AIEE '58 (Western)
- 1958

The program which enables a human being to play a game of chess with theIBM 704 computer is described, which is capable of playing a complete game of Chess, including such moves as castling, promoting, and capturing en passant.

### Artificial intelligence : the heuristic programming approach

- Computer Science
- 1971

The artificial intelligence the heuristic programming approach that will be your best choice for better reading book and you will not spend wasted by reading this website.

### The Greenblatt chess program

- Computer ScienceAFIPS '67 (Fall)
- 1967

The state of the program as of August 1967 is described and some of the details of the heuristics and algorithms employed are given.

### Branch-and-Bound Methods: A Survey

- Computer ScienceOper. Res.
- 1966

The essential features of the branch-and-bound approach to constrained optimization are described, and several specific applications are reviewed, including integer linear programming Land-Doig and Balas methods, nonlinear programming minimization of nonconvex objective functions, and the quadratic assignment problem Gilmore and Lawler methods.