Author:
Liu ChenGuang,Tanaka Kazuyuki
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. de Bruin, A., Pijls, W., Plaat, A.: Solution Tress as a Basis for Game Tree Search. Technical Report EUR-CS-94-04, Department Computer Science, Erasmus University Rotterdam (1994)
2. Karp, R., Zhang, Y.: Bounded Branching Process and AND/OR Tree Evaluation. Random Structures Algorithms 7, 97–116 (1995)
3. Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artificial Intelligence 6, 293–326 (1975)
4. Pearl, J.: Asymptotic Properties of Minimax Tress and Game-Searching Procedures. Artificial Intelligence 14, 113–138 (1980)
5. Pearl, J.: The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm and its Optimality. Communications of the ACM 25, 559–564 (1982)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献