Advances in Computer Games: 12th International Conference, Acg 2009, Pamplona, Spain, May 11-13, 2009, Revised Papers: 12th Int by H. Jaap van den HerikAdvances in Computer Games: 12th International Conference, Acg 2009, Pamplona, Spain, May 11-13, 2009, Revised Papers: 12th Int by H. Jaap van den Herik

Advances in Computer Games: 12th International Conference, Acg 2009, Pamplona, Spain, May 11-13…

byH. Jaap van den HerikEditorPieter Spronck

Paperback | May 20, 2010

Pricing and Purchase Info

$114.36 online 
$136.95 list price save 16%
Earn 572 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

Constituting the thoroughly refereed post-conference proceedings of the twelfth Advances in Computer Games conference held in Spain in 2009, the 20 revised full papers cover topics from Bayesian modeling to incongruity theory and data assurance.

Title:Advances in Computer Games: 12th International Conference, Acg 2009, Pamplona, Spain, May 11-13…Format:PaperbackDimensions:233 pagesPublished:May 20, 2010Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3642129927

ISBN - 13:9783642129926

Look for similar items by category:

Reviews

Table of Contents

Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search.- A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm.- Monte-Carlo Tree Search in Settlers of Catan.- Evaluation Function Based Monte-Carlo LOA.- Monte-Carlo Kakuro.- A Study of UCT and Its Enhancements in an Artificial Game.- Creating an Upper-Confidence-Tree Program for Havannah.- Randomized Parallel Proof-Number Search.- Hex, Braids, the Crossing Rule, and XH-Search.- Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess.- Plans, Patterns, and Move Categories Guiding a Highly Selective Search.- 6-Man Chess and Zugzwangs.- Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K.- Conflict Resolution of Chinese Chess Endgame Knowledge Base.- On Drawn K-In-A-Row Games.- Optimal Analyses for 3×n AB Games in the Worst Case.- Automated Discovery of Search-Extension Features.- Deriving Concepts and Strategies from Chess Tablebases.- Incongruity-Based Adaptive Game Balancing.- Data Assurance in Opaque Computations.