Finding Optimal Strategies for Imperfect Information Games
暂无分享,去创建一个
[1] Claude E. Shannon,et al. Programming a computer for playing chess , 1950 .
[2] J. Neumann,et al. The Theory of Games and Economic Behaviour , 1944 .
[3] S. Vajda,et al. GAMES AND DECISIONS; INTRODUCTION AND CRITICAL SURVEY. , 1958 .
[4] Dana S. Nau,et al. The Last Player Theorem , 1982, Artif. Intell..
[5] David N. L. Levy,et al. Heuristic Programming in Artificial Intelligence , 1991, J. Int. Comput. Games Assoc..
[6] Matthew L. Ginsberg,et al. Partition Search , 1996, AAAI/IAAI, Vol. 1.
[7] Ian Frank,et al. Search and planning under incomplete information - a study using bridge card play , 1998, Distinguished dissertations.
[8] R. A. Corlett,et al. A Monte-Carlo approach to uncertain inference , 1987 .
[9] Ian Frank,et al. Search in Games with Incomplete Information: A Case Study Using Bridge Card Play , 1998, Artif. Intell..
[10] J. Neumann,et al. Theory of games and economic behavior , 1945, 100 Years of Math Milestones.
[11] P. Hudson. Search Games , 1982 .
[12] Alan Bundy,et al. An Adaptation of Proof-Planning to Declarer Play in Bridge , 1992, ECAI.
[13] A. D. Booth. Programming a Computer , 1965 .
[14] J. Blair,et al. Games with Imperfect Information , 1993 .