This volume constitutes the thoroughly refereed post-conference proceedings of the Twelfth Advances in Computer Games Conference, ACG 2009, held in Pamplona, Spain, in May 2009. The 20 revised full papers presented were carefully reviewed and selected from 41 submissions for inclusion in the book. The topics addressed contain Monte-Carlo tree search, Bayesian modeling, selective search, brute force, conflict resolution, solving games, optimization, concept discovery, incongruity theory, and data assurance.
Author(s): Guillaume Chaslot, Christophe Fiter, Jean-Baptiste Hoock (auth.), H. Jaap van den Herik, Pieter Spronck (eds.)
Series: Lecture Notes in Computer Science 6048 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010
Language: English
Pages: 233
Tags: Algorithm Analysis and Problem Complexity; Artificial Intelligence (incl. Robotics); Computation by Abstract Devices; Computer Communication Networks; Discrete Mathematics in Computer Science; Mathematical Logic and Formal Languages
Front Matter....Pages -
Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search....Pages 1-13
A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm....Pages 14-20
Monte-Carlo Tree Search in Settlers of Catan....Pages 21-32
Evaluation Function Based Monte-Carlo LOA....Pages 33-44
Monte-Carlo Kakuro....Pages 45-54
A Study of UCT and Its Enhancements in an Artificial Game....Pages 55-64
Creating an Upper-Confidence-Tree Program for Havannah....Pages 65-74
Randomized Parallel Proof-Number Search....Pages 75-87
Hex, Braids, the Crossing Rule, and XH-Search....Pages 88-98
Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess....Pages 99-110
Plans, Patterns, and Move Categories Guiding a Highly Selective Search....Pages 111-122
6-Man Chess and Zugzwangs....Pages 123-135
Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K....Pages 136-145
Conflict Resolution of Chinese Chess Endgame Knowledge Base....Pages 146-157
On Drawn K-In-A-Row Games....Pages 158-169
Optimal Analyses for 3× n AB Games in the Worst Case....Pages 170-181
Automated Discovery of Search-Extension Features....Pages 182-194
Deriving Concepts and Strategies from Chess Tablebases....Pages 195-207
Incongruity-Based Adaptive Game Balancing....Pages 208-220
Data Assurance in Opaque Computations....Pages 221-231
Back Matter....Pages -
