• Corpus ID: 7894372

An Analysis of Alpha-Beta Priming '

  title={An Analysis of Alpha-Beta Priming '},
  author={Donald Ervin Knuth and Ronald W. Moore},
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… 

Figures and Tables from this paper



Analysis of the alpha-beta pruning algorithm

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 Some Programs That Search Game Trees

The problem of efficiently searching large trees is discussed, and a new method called “dynamic ordering” is described, and the older minimax and Alpha-Beta procedures are described for comparison purposes.

Experiments With a Multipurpose, Theorem-Proving Heuristic Program

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

  • A. Samuel
  • Computer Science
    IBM 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

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

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

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

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.

Problem-solving methods in artificial intelligence

  • N. Nilsson
  • Education
    McGraw-Hill computer science series
  • 1971
This paper will concern you to try reading problem solving methods in artificial intelligence as one of the reading material to finish quickly.

Artificial intelligence : the heuristic programming approach

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.