The variance of two game tree algorithms

Journal of Algorithms

Volumn 28, Issue 1, 1998, Pages 21-39

  Zhang, Yanjun ^a,b  

^a Southern Methodist University   (United States)

^b Research Group   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 11544316415     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0928     Document Type: Article

References (13)

1. G. M. Baudet, On the branching factor of the alpha-beta pruning algorithm, Artificial Intelligence 10 (1978), 173-199.
2. J. L. Doob, "Stochastic Process," Wiley, New York, 1953.
3. S. H. Fuller, J. G. Gaschnig, and J. J. Gillogly, "An Analysis of the Alpha-Beta Pruning Algorithm," Technical report, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, 1973.
4. S. Karlin and H. M. Taylor, "A First Course in Stochastic Processes," 2nd ed., Academic Press, New York 1975.
5. R. M. Karp and Y. Zhang, Bounded branching process and AND/OR tree evaluation, Random Struct. and Algorithms 7(2) (1995), 97-116.
6. D. E. Knuth and R. W. Moore, An analysis of alpha-beta pruning, Artificial Intelligence 6 (1975), 293-326.
7. J. Pearl, Asymptotic properties of minimax trees and game-searching procedures, Artificial Intelligence, 14(2) (1980), 113-138.
8. J. Pearl, The solution for the branching factor of the alpha-beta pruning algorithm and its optimality, Comm. ACM 25(8) (1982), 559-564.
9. J. Pearl, "Heuristics," Addison-Wesley, Reading, MA, 1984.
10. M. Saks and A. Wigderson, Probabilistic boolean decision trees and the complexity of evaluating game trees, in "Proceedings of The Twenty-Seventh Annual Symposium on Foundations of Computer Science," 1986, 29-38.
11. J. Spencer, "Ten Lectures on the Probabilistic Method," SIAM, Philadelphia, PA, 1994.
12. M. Tarsi, Optimal search on some game trees, J. ACM 30 (1983), 389-396.
13. Y. Zhang, On the optimality of randomized α-β search, SIAM J. Comput. 24(1) (1995), 138-147.