Advances in Computer Games

Heuristic search effectiveness depends directly upon the quality of heuristic evaluations of states in the search space. We show why ordinal correlation is relevant to heuristic search, present a metric for assessing the quality of a static evaluation function, and apply it to learn feature weights for a computer chess program.

[1]  Martin Müller,et al.  Computer Go , 2002, Artif. Intell..

[2]  Ronald L. Rivest,et al.  Game Tree Searching by Min/Max Approximation , 1987, Artif. Intell..

[3]  Andrew Tridgell,et al.  KnightCap: A chess program that learns by combining TD( ) with minimax search , 1997, ICML 1997.

[4]  Isabelle Guyon,et al.  An Introduction to Variable and Feature Selection , 2003, J. Mach. Learn. Res..

[5]  Jos W. H. M. Uiterwijk,et al.  Temporal Difference Learning and the Neural MoveMap Heuristic in the Game of Lines of Action , 2002 .

[6]  Bruno Bouzy,et al.  Computer Go: An AI oriented survey , 2001, Artif. Intell..

[7]  N. L. Johnson,et al.  Multivariate Analysis , 1958, Nature.

[8]  Selim G. Akl,et al.  The principal continuation and the killer heuristic , 1977, ACM '77.

[9]  Bruno Bouzy.  Modelisation cognitive du joueur de go , 1995 .

[10]  H. Jaap van den Herik,et al.  Replacement Schemes and Two-Level Tables , 1996, J. Int. Comput. Games Assoc..

[11]  Tony Marsland,et al.  Multi-cut alpha-beta-pruning in game-tree search , 2001, Theor. Comput. Sci..

[12]  Annalisa Bossi,et al.  A method for specializing logic programs , 1990, TOPL.

[13]  Eric O. Postma,et al.  Local Move Prediction in Go , 2002, Computers and Games.

[14]  Ralph Gasser,et al.  SOLVING NINE MEN'S MORRIS , 1996, Comput. Intell..

[15]  Theodore Tegos,et al.  Experiments in Computer Amazons , 2002 .

[16]  Thomas R. Lincke,et al.  Strategies for the Automatic Construction of Opening Books , 2000, Computers and Games.

[17]  Jonathan Schaeffer,et al.  New advances in Alpha-Beta searching , 1996, CSC '96.

[18]  G. Tesauro.  Practical Issues in Temporal Difference Learning , 1992 .

[19]  Jack van Rijswijck.  Search and evaluation in Hex , 2002 .

[20]  David Fotland.  Static Eye Analysis in "The Many Faces of Go" , 2002, J. Int. Comput. Games Assoc..

[21]  Raymond Georg Snatzke.  Exhaustive Search in the Game Amazons , 2001 .

[22]  Stephen B. Gray,et al.  Local Properties of Binary Images in Two Dimensions , 1971, IEEE Transactions on Computers.

[23]  Alistair Moffat,et al.  Practical Length-limited Coding for Large Alphabets , 1995, Comput. J..

[24]  Ed Trice,et al.  The 7-piece Perfect Play Lookup Database for the Game of Checkers , 2003, ACG.

[25]  Ernst A. Heinz,et al.  New Self-Play Results in Computer Chess , 2000, Computers and Games.

[26]  Terrence J. Sejnowski,et al.  Temporal Difference Learning of Position Evaluation in the Game of Go , 1993, NIPS.

[27]  Yngvi Björnsson.  Yl Wins Lines of Action Tournament , 2000, J. Int. Comput. Games Assoc..

[28]  Henri E. Bal,et al.  Awari is Solved , 2002, J. Int. Comput. Games Assoc..

[29]  Shi-Jim Yen,et al.  A positional Judgment System for Computer Go , 2003 .

[30]  J. Schaeffer,et al.  Solving the Game of Checkers , 1996 .

[31]  Michael Buro,et al.  Improving heuristic mini-max search by supervised learning , 2002, Artif. Intell..

[32]  Bruno Bouzy.  Incremental Updating of Objects in INDIGO , 2002 .

[33]  T. Marsland,et al.  Parallel Search of Strongly Ordered Game Trees Contents Introduction 1. Sequential Search Algorithms 2. Enhancements to Alpha-beta Searching 2.1 Aspiration Search 2.2 Transposition Table 2.3 Killer Heuristic 2.4 Iterative Deepening 2.5 Other Searching Techniques 3. Approaches to Parallel Tree Search , 1982 .

[34]  Kazunori Yamaguchi,et al.  Automatic Feature Construction and Optimization for General Game Player , 2001 .

[35]  M. Charles.  A Beautiful Mind , 2003, American journal of psychoanalysis.

[36]  Ernst A. Heinz.  Scalable search in computer chess: algorithmic enhancements and experiments at high search depths , 1999 .

[37]  H. Jaap van den Herik,et al.  PDS-PN: A New Proof-Number Search Algorithm , 2002, Computers and Games.

[38]  Fredrik A. Dahl,et al.  Honte, a go-playing program using neural nets , 2001 .

[39]  T. A. Marsland.  Relative Performance of the Alpha-Beta Algorithm , 1982, J. Int. Comput. Games Assoc..

[40]  Jonathan Schaeffer,et al.  TrellisDAG: A System for Structured DAG Scheduling , 2003, JSSPP.

[41]  C. Luckhardt,et al.  Learning Models of Opponent's Strategies in Game Playing. In , 1996 .

[42]  Richard Barrett,et al.  Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

[43]  Hiroyuki Iida,et al.  Endgame Search Techniques Developed in Shogi: Application to Lines of Action , 2002, JCIS.

[44]  A. Nagai,et al.  Application of df-pn+to Othello Endgames , 1999 .

[45]  Jonathan Schaeffer.  The History Heuristic , 1983, J. Int. Comput. Games Assoc..

[46]  H. Bal,et al.  Solving the Game of Awari using Parallel Retrograde Analysis , 2003 .

[47]  Gerald Tesauro,et al.  Programming backgammon using self-teaching neural nets , 2002, Artif. Intell..

[48]  Richard L. Rudell.  Tutorial: design of a logic synthesis system , 1996, 33rd Design Automation Conference Proceedings, 1996.

[49]  Ken Chen,et al.  Static Analysis of Life and Death in the Game of Go , 1999, Inf. Sci..

[50]  D. Gale.  The Game of Hex and the Brouwer Fixed-Point Theorem , 1979 .

[51]  Anil K. Jain,et al.  Statistical Pattern Recognition: A Review , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[52]  Takashi Chikayama,et al.  Game-tree Search Algorithm based on Realization Probability , 2002, J. Int. Comput. Games Assoc..

[53]  Peter J. Jansen,et al.  Pruning Algorithms for Multi-model Adversary Search , 1998 .

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

[55]  Fred B. Schneider,et al.  A Logical Approach to Discrete Math , 1993, Texts and Monographs in Computer Science.

[56]  Bob Myers.  THE 21st CENTURY CHAMPIONSHIP CUP 2002 , 2002 .

[57]  David B. Benson,et al.  Life in the game of Go , 1976 .

[58]  Kazuhiro Ueda,et al.  An Evolutionary Algorithm Extended by Ecological Analogy and its Application to the Game of Go , 1997, IJCAI.

[59]  M. Enzenberger.  The Integration of A Priori Knowledge into a Go Playing Neural Network , 1996 .

[60]  Shin Ishii,et al.  Strategy Acquisition for the Game "Othello" Based on Reinforcement Learning , 1999, ICONIP.

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

[62]  Michael Buro,et al.  From Simple Features to Sophisticated Evaluation Functions , 1998, Computers and Games.

[63]  T. A. Marsland,et al.  A Review of Game-Tree Pruning , 1986, J. Int. Comput. Games Assoc..

[64]  Thomas R. Lincke,et al.  Large Endgame Databases with Limited Memory Space , 2000, J. Int. Comput. Games Assoc..

[65]  Elwyn R. Berlekamp,et al.  Mathematical Go - chilling gets the last point , 1994 .

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

[67]  Michel Hirschowitz.  Abstract games , 2005, GALOP@ETAPS.

[68]  H. Jaap van den Herik,et al.  The Quad Heuristic in Lines of Action , 2001, J. Int. Comput. Games Assoc..

[69]  Tom Elliott Fawcett.  Feature discovery for problem solving systems , 1993 .

[70]  Kazunori Yamaguchi,et al.  Compiling Logical Features into Specialized State-Evaluators by Partial Evaluation, Boolean Tables and Incremental Calculation , 2000, PRICAI.

[71]  Raymond Georg Snatzke.  New results of exhaustive search in the game Amazons , 2004, Theor. Comput. Sci..

[72]  Vadim V. Anshelevich,et al.  A hierarchical approach to computer Hex , 2002, Artif. Intell..

[73]  Carl Ebeling,et al.  Measuring the Performance Potential of Chess Programs , 1990, Artif. Intell..

[74]  Jing Yang,et al.  New Winning and Losing Positions for 7x7 HEx , 2002, Computers and Games.

[75]  Zhixing Chen,et al.  Semi-Empirical Quantitative Theory of Go Part I: Estimation of the Influence of a Wall , 2002, J. Int. Comput. Games Assoc..

[76]  Gerald Tesauro,et al.  Temporal difference learning and TD-Gammon , 1995, CACM.

[77]  Ernst A. Heinz.  Adaptive Null-Move Pruning , 1999, J. Int. Comput. Games Assoc..

[78]  Albert L. Zobrist.  A Model of Visual Organization for the Game of Go , 1899 .

[79]  L. V. Allis,et al.  Searching for solutions in games and artificial intelligence , 1994 .

[80]  Cameron Browne,et al.  Hex strategy - making the right connections , 2000 .

[81]  Robert Lake,et al.  Solving Large Retrograde Analysis Problems Using a Network of Workstations , 1993 .

[82]  Jonathan Schaeffer,et al.  One jump ahead - challenging human supremacy in checkers , 1997, J. Int. Comput. Games Assoc..