Search Versus Knowledge in Game-Playing Programs Revisited
暂无分享,去创建一个
[1] Kai-Fu Lee,et al. The Development of a World Class Othello Program , 1990, Artif. Intell..
[2] Jonathan Schaeffer,et al. Games: Planning and Learning , 1994, J. Int. Comput. Games Assoc..
[3] Hiroyuki Iida,et al. Tutoring Strategies in Game-Tree Search , 1995, J. Int. Comput. Games Assoc..
[4] K. Thompson,et al. COMPUTER CHESS STRENGTH , 1982 .
[5] Carl Ebeling,et al. Measuring the Performance Potential of Chess Programs , 1990, Artif. Intell..
[6] Donald F. Beal,et al. Random Evaluations in Chess , 1994, J. Int. Comput. Games Assoc..
[7] Duane Szafron,et al. A Re-Examination of Brute-Force Search , 1993 .
[8] Monty Newborn,et al. A Hypothesis concerning the Strength of Chess Programs , 1985, J. Int. Comput. Games Assoc..
[9] Peter Mysliwietz. Konstruktion und Optimierung von Bewertungsfunktionen beim Schach , 1994 .
[10] Jonathan Schaeffer,et al. The Utility of Expert Knowledge , 1985, IJCAI.
[11] Dana S. Nau,et al. Pathology on Game Trees Revisited, and an Alternative to Minimaxing , 1983, Artif. Intell..
[12] Jonathan Schaeffer,et al. Best-First Fixed-Depth Minimax Algorithms , 1996, J. Int. Comput. Games Assoc..
[13] Monroe M. Newborn. Recent Progress in Computer Chess , 1988 .