Adversarial search with procedural knowledge heuristic
暂无分享,去创建一个
Branislav Bosanský | Michal Pechoucek | Viliam Lisý | Michal Jakob | V. Lisý | M. Pechoucek | B. Bosanský | M. Jakob
[1] David Carmel,et al. Learning and using opponent models in adversary search , 1996 .
[2] David Wilkins,et al. Using Patterns and Plans in Chess , 1980, Artif. Intell..
[3] Alan Bundy,et al. Applying adversarial planning techniques to Go , 2001, Theor. Comput. Sci..
[4] Dana S. Nau,et al. Computer Bridge - A Big Win for AI Planning , 1998, AI Mag..
[5] Michael Buro,et al. Heuristic Search Applied to Abstract Combat Games , 2005, Canadian Conference on AI.
[6] John E. Laird,et al. Learning procedural knowledge through observation , 2001, K-CAP '01.
[7] Keki B. Irani,et al. An Algorithmic Solution of N-Person Games , 1986, AAAI.
[8] Michael Buro,et al. Adversarial Planning Through Strategy Simulation , 2007, 2007 IEEE Symposium on Computational Intelligence and Games.
[9] John E. Laird,et al. Learning Goal Hierarchies from Structured Observations and Expert Annotations , 2004, ILP.
[10] Kenrick J. Mock. Hierarchical Heuristic Search Techniques for Empire-based Games , 2002, IC-AI.
[11] Jonathan Schaeffer,et al. Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games , 2004, Computers and Games.