Learning and using opponent models in adversary search

[1]  Keki B. Irani,et al.  An Algorithmic Solution of N-Person Games , 1986, AAAI.

[2]  Richard E. Korf,et al.  Generalized Game Trees , 1989, IJCAI.

[3]  Richard E. Korf.  Multi-Player Alpha-Beta Pruning , 1991, Artif. Intell..

[4]  Arthur L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..

[5]  A. L. Samuel,et al.  Some studies in machine learning using the game of checkers. II: recent progress , 1967 .

[6]  Donald E. Knuth,et al.  The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.

[7]  Jonathan Schaeffer,et al.  A World Championship Caliber Checkers Program , 1992, Artif. Intell..

[8]  Steven Vajda,et al.  Games and Decisions. By R. Duncan Luce and Howard Raiffa. Pp. xi, 509. 70s. 1957. (J Wiley & Sons) , 1959, The Mathematical Gazette.

[9]  Bruce Abramson,et al.  Expected-Outcome: A General Model of Static Evaluation , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  David A. McAllester.  Conspiracy Numbers for Min-Max Search , 1988, Artif. Intell..

[11]  Romeo Çollaku,et al.  Deep thought , 1991, Nature.

[12]  R. Korf.  An Optimal Admissible Tree Search , 1985 .

[13]  P. J. Jansen.  Problematic Positions and Speculative Play , 1990 .

[14]  Hans J. Berliner,et al.  The B* Tree Search Algorithm: A Best-First Proof Procedure , 1979, Artif. Intell..

[15]  Monty Newborn,et al.  How Computers Play Chess , 1990, J. Int. Comput. Games Assoc..

[16]  Claude E. Shannon,et al.  Programming a computer for playing chess , 1950 .

[17]  Peter E. Hart,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[18]  Edmund H. Durfee,et al.  A decision-theoretic approach to coordinating multiagent interactions , 1991, IJCAI 1991.