A limit law for the root value of minimax trees

Electronic Communications in Probability

Volumn 10, Issue , 2005, Pages 273-281

  Ali Khan, Tämur ^a   Devroye, Luc ^b   Neininger, Ralph ^a  

^a GOETHE UNIVERSITY   (Germany)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

Analysis of Algorithms; Gametree; Limit Law; Minimax Tree; Weak Convergence

Indexed keywords

EID: 29244436427     PISSN: None     EISSN: 1083589X     Source Type: Journal    
DOI: 10.1214/ECP.v10-1168     Document Type: Article

References (11)

1. Ali Khan, T. and Neininger, R. Probabilistic analysis for randomized game tree evaluation. Mathematics and computer science. III, 163-174, Trends Math., Birkhauser, Basel, 2004.
2. Devroye, L. and Kamoun, O. Random minimax game trees. Random discrete structures (Minneapolis, MN, 1993), 55-80, IMA Vol. Math. Appl., 76, Springer, New York, 1996
3. Karp, R. M. and Zhang, Y. Bounded branching process and AND/OR tree evaluation. Random Structures Algorithms 7 (1995), 97-116.
4. Knuth, D. E. and Moore, R. W. An analysis of alpha-beta pruning. Artificial Intelligence 6 (1975), 293-326.
5. Nau, D. S. The last player theorem. Artificial Intelligence 18 (1982), 53-65.
6. Nau, D. S. An investigation of the causes of pathology in games. Artificial Intelligence 19 (1982), 257-278.
7. Nau, D. S. Pathology on game trees revisited, and an alternative to minimaxing. (English) Artificial Intelligence 21 (1983), 221-244 (1983).
8. Pearl, J. Asymptotic properties of minimax trees in game-searching procedures. Aritificial Intelligence 14 (1980), 113-126.
9. Saks, M. and Wigderson, A. Probabilistic boolean decision trees and the complexity of evaluating game trees. Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, 29-38, Toronto, Ontario, 1986.
10. Snir, M. Lower bounds on probabilistic linear decision trees. Theor. Comput. Sci. 38 (1985), 69-82.
11. Zhang, Y. The variance of two game tree algorithms. J. Algorithms 28 (1998), 21-39.