Asymptotic complexity of game-searching procedures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 88)
KeywordsTerminal Node Terminal Position Game Tree Directional Algorithm Pruning Algorithm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- Knuth, D. E., and Moore, R. N. An analysis of alpha-beta pruning. Artificial Intelligence 6 (1975), 293–326.Google Scholar
- Slagle, J. R., and Dixon, J. K. Experiments with some programs that search game trees. Journal of the ACM 2 (1969), 189–207.Google Scholar
- Fuller, S. H., Gaschnig, J. G., and Gillogly, J. J. An analysis of the alphabeta purning algorithm. Department of Computer Science Report, Carnegie-Mellon University (1973).Google Scholar
- Baudet, G. M. On the branching factor of the alpha-beta pruning algorithm. Artificial Intelligence 10 (1978), 173–199.Google Scholar
- Pearl, J. An economical method of updating quantile estimates. UCLA-ENG-CSL-8018, University of California, Los Angeles (1980).Google Scholar
- Stockman, G. A minimax algorithm better than alpha-beta? Artificial Intelligence 12 (1979), 179–196.Google Scholar
- Pearl, J. Asymptotic properties of minimax trees and game-searching procedures. UCLA-ENG-CSL-7981, University of Los Angeles (1980). To appear in Artificial Intelligence.Google Scholar
- Noe, T. A comparison of the alpha-beta and SCOUT algorithms using the game of Kalah. UCLA-ENG-CSL-8017, University of California, Los Angeles (1980).Google Scholar
- Pearl, J. The solution for the branching factor of the alpha-beta pruning algorithm. UCLA-ENG-CSL-8019, University of California, Los Angeles (1980).Google Scholar
© Springer-Verlag Berlin Heidelberg 1980