An analysis of alpha-beta pruning

作者: Donald E. Knuth , Ronald W. Moore

DOI: 10.1016/0004-3702(75)90019-3

关键词: NegamaxExpectiminimax treeGame treeKiller heuristicAlgorithmAlpha–beta pruningTransposition tableCorrectnessPrincipal variation searchTheoretical computer scienceComputer science

摘要: … s ~de~ one of the authors of the present Paper 0D.EK) did some of the research described in Section 7 approxinuttely five ~ before he was awar~.~ that deep cutoffs were possible. It is …

参考文章(20)
Donald Ervin Knuth, Sorting and Searching ,(1973)
Robert E. Odeh, Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms Journal of the American Statistical Association. ,vol. 64, pp. 401- ,(1997) , 10.2307/2283757
G M Adel'son-Vel'skii, V L Arlazarov, A R Bitman, A A Zhivotovskii, A V Uskov, Programming a computer to play chess Russian Mathematical Surveys. ,vol. 25, pp. 221- 262 ,(1970) , 10.1070/RM1970V025N02ABEH003792
A. Bernstein, T. Arbuckle, M. De V. Roberts, M. A. Belsky, A chess playing program for the IBM 704 Proceedings of the May 6-8, 1958, western joint computer conference: contrasts in computers on XX - IRE-ACM-AIEE '58 (Western). pp. 157- 159 ,(1958) , 10.1145/1457769.1457813
B. P., Jurg Nievergelt, J. Craig Farrar, Edward M. Reingold, Computer approaches to mathematical problems Mathematics of Computation. ,vol. 29, pp. 656- ,(1975) , 10.2307/2005593
Oskar Perron, Zur Theorie der Matrices Mathematische Annalen. ,vol. 64, pp. 248- 263 ,(1907) , 10.1007/BF01449896
James R. Slagle, John E. Dixon, Experiments With Some Programs That Search Game Trees Journal of the ACM. ,vol. 16, pp. 189- 207 ,(1969) , 10.1145/321510.321511
James R. Slagle, Philip Bursky, Experiments With a Multipurpose, Theorem-Proving Heuristic Program Journal of the ACM. ,vol. 15, pp. 85- 99 ,(1968) , 10.1145/321439.321444