An analysis of alpha-beta pruning

Adelson-Velskiy, 1970, Programming a computer to play chess, Uspehi Mat. Nauk, 25, 221 Balkema, G. Personal communication, July 19, 1974. Bernstein, 1958, A chess-playing program for the IBM 704 computer, 13, 157 Brudno, 1963, Bounds and valuations for shortening the scanning of variations, Problemy Kibernet., 10, 141 Dahl, 1973 Floyd, R. W. Personal communication, January 18, 1965. Fuller, 1973, Analysis of the alpha-beta pruning algorithm, 51 Greenblatt, 1967, The Greenblatt chess program, 31, 801 Hardy, 1934 Hart, 1961, The tree prune (TP) algorithm, 6 Knuth, 1968, 1 Knuth, 1973, 3 Knuth, 1974, Structured programming with go to statements, Comput. Surveys, 6, 261, 10.1145/356635.356640 Lawler, 1966, Branch-and-bound methods: A survey, Operations Res., 14, 699, 10.1287/opre.14.4.699 McCarthy, J. Personal communication, December 1, 1973. Newell, 1958, Chess-playing programs and the problem of complexity, IBM J. Res. and Develop., 2, 320, 10.1147/rd.24.0320 Nievergelt, 1974 Nilsson, 1971 Perron, 1907, Zur Theorie der Matrizen, Math. Ann., 64, 248, 10.1007/BF01449896 Pólya, 1925, 1 Samuel, 1959, Some studies in machine learnin using the game of checkers, IBM J. Res. and Develop, 3, 211, 10.1147/rd.33.0210 Samuel, 1967, Some studies in machine learning using the game of checkers. II—Recent progress, IBM J. Res. and Develop., 11, 601, 10.1147/rd.116.0601 Slagle, 1971 Slagle, 1968, Experiments with a multipurpose, theorem-proving heuristic program, J. ACM, 15, 85, 10.1145/321439.321444 Slagle, 1969, Experiments with some programs that search game trees, J. ACM, 16, 189, 10.1145/321510.321511 Varga, 1962 Wells, 1971