Artificial Intelligence for Games

AI and Games Introduction What Is AI? Model of Game AI Algorithms, Data Structures, and Representations On the Website Layout of the Book Game AI The Complexity Fallacy The Kind of AI in Games Speed and Memory The AI Engine Techniques Movement The Basics of Movement Algorithms Kinematic Movement Algorithms Steering Behaviors Combining Steering Behaviors Predicting Physics Jumping Coordinated Movement Motor Control Movement in the Third Dimension Pathfinding The Pathfinding Graph Dijkstra A* World Representations Improving on A* Hierarchical Pathfinding Other Ideas in Pathfinding Continuous Time Pathfinding Movement Planning Decision Making Overview of Decision Making Decision Trees State Machines Behavior Trees Fuzzy Logic Markov Systems Goal-Oriented Behavior Rule-Based Systems Blackboard Architectures Scripting Action Execution Tactical and Strategic AI Waypoint Tactics Tactical Analyses Tactical Pathfinding Coordinated Action Learning Learning Basics Parameter Modification Action Prediction Decision Learning Naive Bayes Classifiers Decision Tree Learning Reinforcement Learning Artificial Neural Networks Board Games Game Theory Minimaxing Transposition Tables and Memory Memory-Enhanced Test Algorithms Opening Books and Other Set Plays Further Optimizations Turn-Based Strategy Games Supporting Technologies Execution Management Scheduling Anytime Algorithms Level of Detail World Interfacing Communication Getting Knowledge Efficiently Event Managers Polling Stations Sense Management Tools and Content Creation Knowledge for Pathfinding and Waypoint Tactics Knowledge for Movement Knowledge for Decision Making The Toolchain Designing Game AI Designing Game AI The Design Shooters Driving Real-Time Strategy Sports Turn-Based Strategy Games AI-Based Game Genres Teaching Characters Flocking and Herding Games Appendix Books, Periodicals, and Papers Games

[1]  E. Rowland Theory of Games and Economic Behavior , 1946, Nature.

[2]  Michael C. Fu,et al.  An Adaptive Sampling Algorithm for Solving Markov Decision Processes , 2005, Oper. Res..

[3]  Jacques Pitrat,et al.  Realization of a general game-playing program , 1968, IFIP Congress.

[4]  T. Cazenave,et al.  On the Parallelization of UCT , 2007 .

[5]  Rémi Munos,et al.  Adaptive play in Texas Hold'em Poker , 2008, ECAI.

[6]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[7]  Murray Campbell,et al.  Singular Extensions: Adding Selectivity to Brute-Force Searching , 1990, Artif. Intell..

[8]  Murray Campbell,et al.  Deep Blue , 2002, Artif. Intell..

[9]  Marco Antonio Gómez-Martín,et al.  Dynamic Expansion of Behaviour Trees , 2008, AIIDE.

[10]  John E. Laird,et al.  Research in human-level AI using computer games , 2002, CACM.

[11]  H. Jaap van den Herik,et al.  Single-Player Monte-Carlo Tree Search , 2008, Computers and Games.

[12]  Donald F. Beal,et al.  A Generalised Quiescence Search Algorithm , 1990, Artif. Intell..

[13]  Tristan Cazenave,et al.  Combining Tactical Search and Monte-Carlo in the Game of Go , 2005, CIG.

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

[15]  Olivier Teytaud,et al.  On the Parallelization of Monte-Carlo planning , 2008, ICINCO 2008.

[16]  H. Jaap van den Herik,et al.  Progressive Strategies for Monte-Carlo Tree Search , 2008 .

[17]  Jonathan Schaeffer,et al.  Dynamic Control in Real-Time Heuristic Search , 2008, J. Artif. Intell. Res..

[18]  Yngvi Björnsson,et al.  Simulation-Based Approach to General Game Playing , 2008, AAAI.

[19]  Richard E. Korf,et al.  Compressed Pattern Databases , 2007, J. Artif. Intell. Res..

[20]  George C. Stockman,et al.  A Minimax Algorithm Better than Alpha-Beta? , 1979, Artif. Intell..

[21]  Bruno Bouzy,et al.  Monte-Carlo strategies for computer Go , 2006 .

[22]  Bruno Bouzy,et al.  Associating domain-dependent knowledge and Monte Carlo approaches within a Go program , 2005, Inf. Sci..

[23]  Tristan Cazenave,et al.  Optimizations of data structures, heuristics and algorithms for path-finding on maps , 2006, 2006 IEEE Symposium on Computational Intelligence and Games.

[24]  Jonathan Schaeffer,et al.  Conspiracy Numbers , 1990, Artif. Intell..

[25]  Rémi Coulom,et al.  Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search , 2006, Computers and Games.

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

[27]  Olivier Teytaud,et al.  Modification of UCT with Patterns in Monte-Carlo Go , 2006 .

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

[29]  T. Anthony Marsland,et al.  A Comparison of Minimax Tree Search Algorithms , 1983, Artif. Intell..

[30]  Larry S. Davis,et al.  Pattern Databases , 1979, Data Base Design Techniques II.

[31]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[32]  Steve Rabin,et al.  AI Game Programming Wisdom , 2002 .

[33]  Bernd Brügmann Max-Planck Monte Carlo Go , 1993 .

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

[35]  Ken Thompson,et al.  6-Piece Endgames , 1996, J. Int. Comput. Games Assoc..

[36]  Jonathan Schaeffer,et al.  Games, computers, and artificial intelligence , 2002, Artif. Intell..

[37]  Judea Pearl,et al.  SCOUT: A Simple Game-Searching Algorithm with Proven Optimal Properties , 1980, AAAI.

[38]  Richard E. Korf,et al.  Finding Optimal Solutions to Rubik's Cube Using Pattern Databases , 1997, AAAI/IAAI.

[39]  Richard E. Korf,et al.  Additive Pattern Database Heuristics , 2004, J. Artif. Intell. Res..

[40]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[41]  H. Jaap van den Herik,et al.  Proof-Number Search , 1994, Artif. Intell..

[42]  David J. Slate,et al.  Chess 4.5-The Northwestern University chess program , 1988 .

[43]  Roberto Ierusalimschy,et al.  The evolution of Lua , 2007, HOPL.

[44]  Rémi Coulom,et al.  Computing "Elo Ratings" of Move Patterns in the Game of Go , 2007, J. Int. Comput. Games Assoc..

[45]  Judea Pearl,et al.  Asymptotic Properties of Minimax Trees and Game-Searching Procedures , 1980, Artif. Intell..

[46]  Jonathan Schaeffer,et al.  Best-First Fixed-Depth Minimax Algorithms , 1996, J. Int. Comput. Games Assoc..

[47]  Hector Muñoz-Avila,et al.  Hierarchical Plan Representations for Encoding Strategic Game AI , 2005, AIIDE.

[48]  Ken Perlin Toward Interactive Narrative , 2005, International Conference on Virtual Storytelling.

[49]  Andreas Junghanns,et al.  Are there Practical Alternatives to Alpha-Beta? , 1998, J. Int. Comput. Games Assoc..

[50]  Henri E. Bal,et al.  Solving awari with parallel retrograde analysis , 2003, Computer.

[51]  Albert L. Zobrist,et al.  A New Hashing Method with Application for Game Playing , 1990 .

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

[53]  Csaba Szepesvári,et al.  Bandit Based Monte-Carlo Planning , 2006, ECML.

[54]  Graham Kendall,et al.  A Survey of NP-Complete Puzzles , 2008, J. Int. Comput. Games Assoc..

[55]  Randall W. Hill,et al.  Toward a New Generation of Virtual Humans for Interactive Experiences , 2002, IEEE Intell. Syst..

[56]  Alex Sandro Gomes,et al.  Dynamic Game Balancing: An Evaluation of User Satisfaction , 2006, AIIDE.

[57]  Bruno Bouzy,et al.  Monte-Carlo Go Developments , 2003, ACG.

[58]  A. V. Uskov,et al.  Programming a computer to play chess , 1970 .

[59]  Eric O. Postma,et al.  Adaptive game AI with dynamic scripting , 2006, Machine Learning.

[60]  Jonathan Schaeffer,et al.  Sokoban: Enhancing general single-agent search methods using domain knowledge , 2001, Artif. Intell..

[61]  Tristan Cazenave,et al.  A Phantom-Go Program , 2006, ACG.

[62]  Tristan Cazenave,et al.  Metarules to improve tactical Go knowledge , 2003, Inf. Sci..

[63]  Ronald J. Williams,et al.  Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning , 2004, Machine Learning.

[64]  M. Csíkszentmihályi Beyond boredom and anxiety , 1975 .

[65]  Jonathan Schaeffer,et al.  Checkers Is Solved , 2007, Science.

[66]  Jonathan Schaeffer,et al.  The History Heuristic and Alpha-Beta Search Enhancements in Practice , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[67]  Donald E. Knuth,et al.  An Analysis of Alpha-Beta Pruning , 1975, Artif. Intell..

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

[69]  Donald E. Eastlake,et al.  The Greenblatt chess program , 1967, AFIPS '67 (Fall).

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