Player Modeling, Search Algorithms and Strategies in Multi-player Games
暂无分享,去创建一个
[1] Alexander Reinefeld,et al. An Improvement to the Scout Tree Search Algorithm , 1983, J. Int. Comput. Games Assoc..
[2] Jonathan Schaeffer,et al. The History Heuristic and Alpha-Beta Search Enhancements in Practice , 1989, IEEE Trans. Pattern Anal. Mach. Intell..
[3] Donald E. Knuth,et al. An Analysis of Alpha-Beta Pruning , 1975, Artif. Intell..
[4] M. Degroot. Game Theory: Mathematical Models of Conflict , 1980 .
[5] Claude E. Shannon,et al. Programming a computer for playing chess , 1950 .
[6] A. Mas-Colell,et al. Microeconomic Theory , 1995 .
[7] Ingo Althöfer,et al. Root Evaluation Errors: How they Arise and Propagate , 1988, J. Int. Comput. Games Assoc..
[8] J. Nash. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.
[9] Zongmin Ma,et al. Computers and Games , 2008, Lecture Notes in Computer Science.
[10] Keki B. Irani,et al. An Algorithmic Solution of N-Person Games , 1986, AAAI.
[11] Jonathan Schaeffer,et al. Best-First Fixed-Depth Minimax Algorithms , 1996, J. Int. Comput. Games Assoc..
[12] Richard E. Korf,et al. On Pruning Techniques for Multi-Player Games , 2000, AAAI/IAAI.
[13] Ulf Lorenz,et al. The Secret of Selective Game Tree Search, When Using Random-Error Evaluations , 2002, STACS.
[14] Hermann Kaindl,et al. The Reason for the Benefits of Minimax Search , 1989, IJCAI.
[15] Ilya Segal,et al. Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green , 1997 .
[16] Dana S. Nau,et al. Pathology on Game Trees Revisited, and an Alternative to Minimaxing , 1983, Artif. Intell..
[17] Nathan R. Sturtevant,et al. A Comparison of Algorithms for Multi-player Games , 2002, Computers and Games.
[18] Richard E. Korf,et al. Contents , 1979, Brain and Development.