Advances in Computer Games

12th International Conference, ACG 2009, Pamplona Spain, May 11-13, 2009. Revised Papers

  • H. Jaap van den Herik
  • Pieter Spronck
Conference proceedings ACG 2009
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6048)

Table of contents

  1. Front Matter
    PDF
  2. Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search
    Guillaume Chaslot, Christophe Fiter, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud
    Pages 1-13
  3. A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm
    Markus Enzenberger, Martin Müller
    Pages 14-20
  4. Monte-Carlo Tree Search in Settlers of Catan
    István Szita, Guillaume Chaslot, Pieter Spronck
    Pages 21-32
  5. Evaluation Function Based Monte-Carlo LOA
    Mark H. M. Winands, Yngvi Björnsson
    Pages 33-44
  6. Monte-Carlo Kakuro
    Tristan Cazenave
    Pages 45-54
  7. A Study of UCT and Its Enhancements in an Artificial Game
    David Tom, Martin Müller
    Pages 55-64
  8. Creating an Upper-Confidence-Tree Program for Havannah
    Fabien Teytaud, Olivier Teytaud
    Pages 65-74
  9. Randomized Parallel Proof-Number Search
    Jahn-Takeshi Saito, Mark H. M. Winands, H. Jaap van den Herik
    Pages 75-87
  10. Hex, Braids, the Crossing Rule, and XH-Search
    Philip Henderson, Broderick Arneson, Ryan B. Hayward
    Pages 88-98
  11. Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess
    Guy Haworth, Ken Regan, Giuseppe Di Fatta
    Pages 99-110
  12. Plans, Patterns, and Move Categories Guiding a Highly Selective Search
    Gerhard Trippen
    Pages 111-122
  13. 6-Man Chess and Zugzwangs
    Eiko Bleicher, Guy Haworth
    Pages 123-135
  14. Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K
    Paolo Ciancarini, Gian Piero Favini
    Pages 136-145
  15. Conflict Resolution of Chinese Chess Endgame Knowledge Base
    Bo-Nian Chen, Pangfang Liu, Shun-Chin Hsu, Tsan-sheng Hsu
    Pages 146-157
  16. On Drawn K-In-A-Row Games
    Sheng-Hao Chiang, I-Chen Wu, Ping-Hung Lin
    Pages 158-169
  17. Optimal Analyses for 3×n AB Games in the Worst Case
    Li-Te Huang, Shun-Shii Lin
    Pages 170-181
  18. Automated Discovery of Search-Extension Features
    Pálmi Skowronski, Yngvi Björnsson, Mark H. M. Winands
    Pages 182-194
  19. Deriving Concepts and Strategies from Chess Tablebases
    Matej Guid, Martin Možina, Aleksander Sadikov, Ivan Bratko
    Pages 195-207
  20. Incongruity-Based Adaptive Game Balancing
    Giel van Lankveld, Pieter Spronck, H. Jaap van den Herik, Matthias Rauterberg
    Pages 208-220

About these proceedings

Keywords

Ada Bayesian modeling Extension algorithms brute force knowledge knowledge base modeling optimization search algorithm solving games tree search

Editors and affiliations

  • H. Jaap van den Herik
    • 1
  • Pieter Spronck
    • 2
  1. 1.Games and AI Group, MICC, Faculty of Humanities and SciencesUniversiteit MaastrichtMaastrichtThe Netherlands
  2. 2.Institute for Knowledge and Agent TechnologyUniversiteit Maastricht 

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-12993-3
  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-12992-6
  • Online ISBN 978-3-642-12993-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349