An analysis of alpha-beta pruning |
| |
| Authors: | Donald E Knuth Ronald W Moore |
| |
| Affiliation: | Computer Science Department, Stanford University, Stanford, Calif. 94305, U.S.A. |
| |
| Abstract: | The alpha-beta technique for searching game trees is analyzed, in an attempt to provide some insight into its behavior. The first portion of this paper is an expository presentation of the method together with a proof of its correctness and a historical discussion. The alpha-beta procedure is shown to be optimal in a certain sense, and bounds are obtained for its running time with various kinds of random data. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
