Author:
Gao Xinbo,Iida Hiroyuki,Uiterwijk Jos W. H. M.,van den Herik H. Jaap
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. G.M. Adelson-Velskiy, V.L. Arlazarov and M.V. Donskoy. Some Methods of Controlling the Tree Search in Chess Programs. Artificial Intelligence, 6(4):361–371, 1975.
2. M. Buro. ProbCut: An Effective Selective Extension of the Alpha-Beta Algorithm. ICCA Journal, 18(2):71–76, 1995.
3. D. Carmel and S. Markovitch. Pruning Algorithms for Multi-Model Adversary Search. Artificial Intelligence, 99(2):325–355, 1998.
4. CS 93-03;H. Iida,1993
5. H. Iida, J.W.H.M. Uiterwijk, H.J. van den Herik, and I.S. Herschberg. Potential Applications of Opponent-Model Search. Part 1: The Domain of Applicablity. ICCA Journal, 16(4):201–208, 1993.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献