PERFECT RECALL AND PRUNING IN GAMES WITH IMPERFECT INFORMATION 1
暂无分享,去创建一个
[1] Bruce W. Ballard,et al. The *-Minimax Search Procedure for Trees Containing Chance Nodes , 1983, Artif. Intell..
[2] Nicholas V. Findler,et al. Studies in machine cognition using the game of poker , 1977, CACM.
[3] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[4] Jonathan Schaeffer,et al. Man versus Machine for the World Checkers Championship , 1993, J. Int. Comput. Games Assoc..
[5] Bernhard von Stengel,et al. Fast algorithms for finding randomized strategies in game trees , 1994, STOC '94.
[6] H. W. Kuhn,et al. 11. Extensive Games and the Problem of Information , 1953 .
[7] Claude E. Shannon,et al. XXII. Programming a Computer for Playing Chess 1 , 1950 .
[8] Dana S. Nau,et al. The Last Player Theorem , 1982, Artif. Intell..
[9] David A. McAllester. Conspiracy Numbers for Min-Max Search , 1988, Artif. Intell..
[10] Donald E. Knuth,et al. The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.
[11] J. Nash. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.
[12] Michael van Lent,et al. A Pruning Algorithm for Imperfect Information Games , 1993 .
[13] Judea Pearl,et al. Asymptotic Properties of Minimax Trees and Game-Searching Procedures , 1980, Artif. Intell..
[14] J. R. Quinlan. A Knowledge-Based System for Locating Missing High Cards in Bridge , 1979, IJCAI.
[15] Philip Wolfe,et al. Contributions to the theory of games , 1953 .
[16] Murray Campbell,et al. Singular Extensions: Adding Selectivity to Brute-Force Searching , 1990, Artif. Intell..
[17] J. R. Quintan. A knowledge-based system for locating missing high cards in bridge , 1979, IJCAI 1979.
[18] Keki B. Irani,et al. An Algorithmic Solution of N-Person Games , 1986, AAAI.
[19] Cheng Liu,et al. Heuristic Search in One-Player Games With Hidden Information , 1992 .
[20] James R. Slagle,et al. Experiments With Some Programs That Search Game Trees , 1969, JACM.
[21] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .
[22] Robert Wilson. Computing Equilibria of Two-Person Games from the Extensive Form , 1972 .
[23] D. Koller,et al. The complexity of two-person zero-sum games in extensive form , 1992 .
[24] Howard James Bampton. Solving Imperfect Information Games Using the Monte Carlo Heuristic , 1994 .
[25] Jonathan Schaeffer,et al. Conspiracy Numbers , 1990, Artif. Intell..
[26] Richard E. Korf. Multi-Player Alpha-Beta Pruning , 1991, Artif. Intell..
[27] Claude E. Shannon,et al. Programming a computer for playing chess , 1950 .
[28] Annika Wærn,et al. Pragmatic Reasoning in Bridge , 1993 .
[29] Hans J. Berliner,et al. Backgammon Computer Program Beats World Champion , 1980 .
[30] G. L. Thompson. 14. Signaling Strategies in n-Person Games , 1953 .
[31] Ki Hang Kim. Game theory in the social sciences , 1986 .
[32] Monty Newborn,et al. The 22d annual ACM international computer chess championship , 1992, CACM.
[33] Howard Raiffa,et al. Games And Decisions , 1958 .
[34] J. Neumann. Zur Theorie der Gesellschaftsspiele , 1928 .
[35] Dana S. Nau,et al. Strategic planning for imperfect-information games , 1993 .
[36] Steven A. Gordon. A COMPARISON BETWEEN PROBABILISTIC SEARCH AND WEIGHTED HEURISTICS IN A GAME WITH INCOMPLETE INFORMATION , 1993 .
[37] Kai-Fu Lee,et al. The Development of a World Class Othello Program , 1990, Artif. Intell..
[38] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .