This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The History Heuristic and Alpha-Beta Search Enhancements in Practice
November 1989 (vol. 11 no. 11)
pp. 1203-1212

Many enhancements to the alpha-beta algorithm have been proposed to help reduce the size of minimax trees. A recent enhancement, the history heuristic, which improves the order in which branches are considered at interior nodes is described. A comprehensive set of experiments is reported which tries all combinations of enhancements to determine which one yields the best performance. In contrast, previous work on assessing their performance has concentrated on the benefits of individual enhancements or a few combinations. The aim is to find the combination that provides the greatest reduction in tree size. Results indicate that the history heuristic combined with transposition tables significantly outperforms other alpha-beta enhancements in application-generated game trees. For trees up to depth 8, this combination accounts for 99% of the possible reductions in tree size, with the other enhancements yielding insignificant gains.

[1] J. Gillogly, "Performance analysis of the technology chess program," Ph.D. thesis, Comput. Sci. Dept., Carnegie-Mellon Univ., Pittsburgh, PA, Mar., 1978.
[2] D. J. Slate and L. R. Atkin, "Chess 4.5--The Northwestern University chess program," inChess Skill in Man and Machine, P. W. Frey, Ed. New York: Springer-Verlag, 1977, pp. 82-118.
[3] S. G. Akl and M. M. Newborn, "The principal continuation and the killer heuristic," inProc. ACM Nat. Conf., Seattle, WA, 1977, pp. 466-473.
[4] J. Pearl, "Scout: A simple game-searching algorithm with proven optimal properties," inProc. First Annu. Nat. Conf. Artificial Intelligence, Stanford, CA, 1980.
[5] G. Baudet, "The design and analysis of algorithms for asynchronous multiprocessors," Ph.D. dissertation, Dep. Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, Apr. 1978.
[6] M. S. Campbell and T. A. Marsland, "A comparison of minimax tree search algorithms,"Artificial Intell., vol. 20, pp. 347-367, 1983.
[7] T. A. Marsland, "A review of game-tree pruning,"J. Int. Computer Chess Assoc., vol. 9, no. 1, pp. 3-19, 1986.
[8] T. A. Marsland, "Relative efficiency of alpha-beta implementations," inProc. Int. Joint Conf. Artificial Intelligence, Karlsruhe, 1983, pp. 763-766.
[9] J. Schaeffer, "Experiments in search and knowledge," Ph.D. dissertation, Univ. of Waterloo, Canada, May 1986.
[10] J. Schaeffer, "The history heuristic,"J. Int. Comput. Chess Assoc., vol. 6, no. 3, pp. 16-19, 1983.
[11] D. E. Knuth and R. W. Moore, "An analysis of alpha-beta pruning,"Artificial Intell., vol. 6, pp. 293-326, 1975.
[12] R. D. Greenblatt, D. E. Eastlake and S. D. Crocker, "The Greenblatt chess program," inProc. Fall Joint Computer Conf., vol. 31, 1967, pp. 801-810.
[13] A. Reinefeld, "An improvement of the scout tree search algorithm,"J. Int. Comput. Chess Assoc., vol. 6, no. 4, pp. 4-14, 1983.
[14] R. A. Finkel, J. Fishburn, and S. A. Lawless, "Parallel alpha-beta search on Arachne," inProc. Int. Conf. Parallel Processing, 1980, pp. 235-243.
[15] T. A. Marsland, A. Reinefeld, and J. Schaeffer, "Low overhead alternatives to SSS*,"Artificial Intell., vol. 31, no. 2, pp. 185-199, 1987.
[16] R. M. Hyatt, "Cray Blitz--A computer chess playing program," M.Sc. thesis, Univ. Southern Mississippi, 1983.
[17] A. Newell and H. A. Simon, inHuman Problem Solving. Englewood Cliffs, NJ: Prentice-Hall, 1972.
[18] G. M. Adelson-Velskiy, V. L. Arlazarov, and M. V. Donskoy, "Some methods of controlling the tree search in chess programs,"Artificial Intell., vol. 6, pp. 361-371, 1975.
[19] D. S. Nau, "Quality of decision versus depth of search on game trees," Ph.D. dissertation, Dep. Comput. Sci., Duke Univ., 1979,
[20] D. Kopec and I. Bratko, "The Bratko-Kopec experiment: A comparison of human and computer performance in chess," inAdvances in Computer Chess 3, M. R. B. Clarke, Ed. New York: Pergamon, 1982, pp. 57-72.
[21] M. Newborn, "A parallel search chess program," inProc. 1985 ACM Annu. Conf., Oct. 1985, pp. 272-277.
[22] T. A. Marsland, M. Olafsson, and J. Schaeffer, "Multiprocessor tree-search experiments," inAdvances in Computer Chess 4, D. Beal, Ed. Oxford, UK: Pergamon, 1985, pp. 37-51.
[23] J. Slagle and J. Dixon, "Experiments with some programs that search game trees,"J. ACM, voI. 2, pp. 189-207, 1969.
[24] A. Muszycka and R. Shinghal, "An empirical comparison of pruning strategies in game trees,"IEEE Trans. Syst., Man, Cybern., vol. SMC-15, no, 3, pp. 389-399, 1985.
[25] C. Ebeling, "All the right moves: A VLSI architecture for chess," Ph.D. dissertation, Dep. Comput. Sci., Carnegie-Mellon Univ., 1986.
[26] J. Schaeffer, "Distributed game-tree searching,"J. Parallel Distributed Comput., vol. 6, pp. 90-114, 1989.
[27] D. Beal, "Null moves," inAdvances in Computer Chess V. Beal, Ed. Amsterdam, The Netherlands: Elsevier, 1989, pp. 65-80.
[28] G. Goetsch and M. Campbell, "Experiments with the null move in chess," inProc. AAAI Sprint Symp., 1988, pp. 14-18.
[29] T. Anantharaman, M. Campbell, and F. H. Hsu, "Singular extensions: Adding selectivity to brute-force searching," inProc. AAAI Spring Symp., Artificial Intell., to be published.
[30] D. A. McAllester, "Conspiracy numbers for min-max search,"Artificial Intell., vol. 35, no. 3, pp. 287-310, 1988.
[31] J. Schaeffer, "Conspiracy numbers," inAdvances in Computer Chess V, D. Beal, Ed. Amsterdam, The Netherlands: Elsevier, 1989, pp. 199-218; also to appear inArtificial Intell.

Index Terms:
history heuristic; alpha-beta search enhancements; minimax trees; interior nodes; transposition tables; game trees; minimax techniques; search problems; trees (mathematics)
Citation:
J. Schaeffer, "The History Heuristic and Alpha-Beta Search Enhancements in Practice," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 11, pp. 1203-1212, Nov. 1989, doi:10.1109/34.42858
Usage of this product signifies your acceptance of the Terms of Use.