Robust game play against unknown opponents
暂无分享,去创建一个
[1] Nathan R. Sturtevant. Leaf-Value Tables for Pruning Non-Zero-Sum Games , 2005, IJCAI.
[2] Jonathan Schaeffer,et al. Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games , 2004, Computers and Games.
[3] Hiroyuki Iida,et al. Potential Applications of Opponent-Model Search , 1994, J. Int. Comput. Games Assoc..
[4] Keki B. Irani,et al. An Algorithmic Solution of N-Person Games , 1986, AAAI.
[5] Matthew L. Ginsberg,et al. GIB: Imperfect Information in a Computationally Challenging Game , 2011, J. Artif. Intell. Res..
[6] David Carmel,et al. Incorporating Opponent Models into Adversary Search , 1996, AAAI/IAAI, Vol. 1.
[7] H. Jaap van den Herik,et al. Probabilistic opponent-model search , 2001, Inf. Sci..
[8] Peter J. Jansen,et al. Using knowledge about the opponent in game-tree search , 1992 .
[9] Richard E. Korf,et al. Generalized Game Trees , 1989, IJCAI.
[10] Nathan R. Sturtevant,et al. Variety Reasoning for Multiset Constraint Propagation , 2009, IJCAI.
[11] Thomas G. Dietterich. What is machine learning? , 2020, Archives of Disease in Childhood.
[12] Michael H. Bowling,et al. Bayes' Bluff: Opponent Modelling in Poker , 2005, UAI 2005.
[13] Jonathan Schaeffer,et al. A World Championship Caliber Checkers Program , 1992, Artif. Intell..
[14] Ulf Lorenz,et al. Player Modeling, Search Algorithms and Strategies in Multi-player Games , 2006, ACG.