Skip to main content
  • Conference proceedings
  • © 2010

Advances in Computer Games

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

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6048)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): ACG: Advances in Computer Games

Conference proceedings info: ACG 2009.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (20 papers)

  1. Front Matter

  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. 6-Man Chess and Zugzwangs

    • Eiko Bleicher, Guy Haworth
    Pages 123-135
  13. Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K

    • Paolo Ciancarini, Gian Piero Favini
    Pages 136-145
  14. Conflict Resolution of Chinese Chess Endgame Knowledge Base

    • Bo-Nian Chen, Pangfang Liu, Shun-Chin Hsu, Tsan-sheng Hsu
    Pages 146-157
  15. On Drawn K-In-A-Row Games

    • Sheng-Hao Chiang, I-Chen Wu, Ping-Hung Lin
    Pages 158-169
  16. Optimal Analyses for 3×n AB Games in the Worst Case

    • Li-Te Huang, Shun-Shii Lin
    Pages 170-181
  17. Automated Discovery of Search-Extension Features

    • Pálmi Skowronski, Yngvi Björnsson, Mark H. M. Winands
    Pages 182-194
  18. Deriving Concepts and Strategies from Chess Tablebases

    • Matej Guid, Martin Možina, Aleksander Sadikov, Ivan Bratko
    Pages 195-207
  19. Incongruity-Based Adaptive Game Balancing

    • Giel van Lankveld, Pieter Spronck, H. Jaap van den Herik, Matthias Rauterberg
    Pages 208-220

Other Volumes

  1. Advances in Computer Games

Editors and Affiliations

  • Games and AI Group, MICC, Faculty of Humanities and Sciences, Universiteit Maastricht, Maastricht, The Netherlands

    H. Jaap Herik

  • Institute for Knowledge and Agent Technology, Universiteit Maastricht,  

    Pieter Spronck

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access