Multi-cut alpha-beta-pruning in game-tree search
暂无分享,去创建一个
[1] Dana S. Nau. Pathology on Game Trees: A Summary of Results , 1980, AAAI.
[2] Jack Belzer,et al. Encyclopedia of Computer Science and Technology , 2002 .
[3] Jonathan Schaeffer,et al. The History Heuristic and Alpha-Beta Search Enhancements in Practice , 1989, IEEE Trans. Pattern Anal. Mach. Intell..
[4] Donald E. Knuth,et al. The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.
[5] Thomas S. Anantharaman,et al. A Statistical Study of Selective Min-Max Search in Computer Chess , 1991, J. Int. Comput. Games Assoc..
[6] Murray Campbell,et al. Singular Extensions: Adding Selectivity to Brute-Force Searching , 1990, Artif. Intell..
[7] Deniz Yuret,et al. Alpha-Beta-Conspiracy Search , 2002, J. Int. Comput. Games Assoc..
[8] Andreas Junghanns,et al. Are there Practical Alternatives to Alpha-Beta? , 1998, J. Int. Comput. Games Assoc..
[9] Peter W. Frey,et al. Chess Skill in Man and Machine , 1984, Springer New York.
[10] T. A. Marsland,et al. Single-Agent and Game-Tree Search , 1991, J. Int. Comput. Games Assoc..
[11] Alexander Reinefeld,et al. An Improvement to the Scout Tree Search Algorithm , 1983, J. Int. Comput. Games Assoc..
[12] T. Anthony Marsland,et al. Relative Efficiency of Alpha-Beta Implementations , 1983, IJCAI.
[13] Fred Popowich,et al. Parallel Game-Tree Search , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.