


default search action
ACG 2009: Pamplona, Spain
- H. Jaap van den Herik, Pieter Spronck:
Advances in Computer Games, 12th International Conference, ACG 2009, Pamplona, Spain, May 11-13, 2009. Revised Papers. Lecture Notes in Computer Science 6048, Springer 2010, ISBN 978-3-642-12992-6 - Guillaume Chaslot, Christophe Fiter
, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud:
Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search. 1-13 - Markus Enzenberger, Martin Müller:
A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm. 14-20 - Istvan Szita, Guillaume Chaslot, Pieter Spronck:
Monte-Carlo Tree Search in Settlers of Catan. 21-32 - Mark H. M. Winands
, Yngvi Björnsson:
Evaluation Function Based Monte-Carlo LOA. 33-44 - David Tom, Martin Müller:
A Study of UCT and Its Enhancements in an Artificial Game. 55-64 - Fabien Teytaud, Olivier Teytaud:
Creating an Upper-Confidence-Tree Program for Havannah. 65-74 - Jahn-Takeshi Saito, Mark H. M. Winands
, H. Jaap van den Herik:
Randomized Parallel Proof-Number Search. 75-87 - Philip Henderson, Broderick Arneson, Ryan B. Hayward:
Hex, Braids, the Crossing Rule, and XH-Search. 88-98 - Guy Haworth, Kenneth W. Regan, Giuseppe Di Fatta
:
Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess. 99-110 - Gerhard Trippen:
Plans, Patterns, and Move Categories Guiding a Highly Selective Search. 111-122 - Eiko Bleicher, Guy Haworth:
6-Man Chess and Zugzwangs. 123-135 - Paolo Ciancarini
, Gian Piero Favini:
Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K. 136-145 - Bo-Nian Chen, Pangfeng Liu
, Shun-chin Hsu, Tsan-sheng Hsu:
Conflict Resolution of Chinese Chess Endgame Knowledge Base. 146-157 - Sheng-Hao Chiang, I-Chen Wu
, Ping-Hung Lin:
On Drawn K-In-A-Row Games. 158-169 - Li-Te Huang, Shun-Shii Lin:
Optimal Analyses for 3×n AB Games in the Worst Case. 170-181 - Pálmi Skowronski, Yngvi Björnsson, Mark H. M. Winands
:
Automated Discovery of Search-Extension Features. 182-194 - Matej Guid, Martin Mozina, Aleksander Sadikov, Ivan Bratko:
Deriving Concepts and Strategies from Chess Tablebases. 195-207 - Giel van Lankveld, Pieter Spronck, H. Jaap van den Herik, Matthias Rauterberg
:
Incongruity-Based Adaptive Game Balancing. 208-220 - Joe Hurd, Guy Haworth:
Data Assurance in Opaque Computations. 221-231

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.