Skip to main content
SpringerLink
Log in

Advances in Computer Games

13th International Conference, ACG 2011, Tilburg, The Netherlands, November 20-22, 2011, Revised Selected Papers

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. H. Jaap Herik

    1. Tilburg Institute of Cognition and Communication, Tilburg University, Tilburg, The Netherlands

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Aske Plaat

    1. Tilburg Institute of Cognition and Communication, Tilburg University, Tilburg, The Netherlands

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • State-of-the-art research
  • Fast-track conference proceedings
  • Unique visibility

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

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

Included in the following conference series:

Conference proceedings info: ACG 2011.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (29 papers)

  1. Front Matter

    Download chapter PDF

  2. Accelerated UCT and Its Application to Two-Player Games

    • Junichi Hashimoto, Akihiro Kishimoto, Kazuki Yoshizoe, Kokolo Ikeda
    Pages 1-12

  3. Revisiting Move Groups in Monte-Carlo Tree Search

    • Gabriel Van Eyck, Martin Müller
    Pages 13-23

  4. PACHI: State of the Art Open Source Go Program

    • Petr BaudiÅ¡, Jean-loup Gailly
    Pages 24-38

  5. Time Management for Monte-Carlo Tree Search in Go

    • Hendrik Baier, Mark H. M. Winands
    Pages 39-51

  6. An MCTS Program to Play EinStein Würfelt Nicht!

    • Richard J. Lorentz
    Pages 52-59

  7. Monte-Carlo Tree Search Enhancements for Havannah

    • Jan A. Stankiewicz, Mark H. M. Winands, Jos W. H. M. Uiterwijk
    Pages 60-71

  8. Playout Search for Monte-Carlo Tree Search in Multi-player Games

    • J. (Pim) A. M. Nijssen, Mark H. M. Winands
    Pages 72-83

  9. Towards a Solution of 7x7 Go with Meta-MCTS

    • Cheng-Wei Chou, Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Tsan-Cheng Su, Fabien Teytaud et al.
    Pages 84-95

  10. MCTS Experiments on the Voronoi Game

    • Bruno Bouzy, Marc Métivier, Damien Pellier
    Pages 96-107

  11. 4*4-Pattern and Bayesian Learning in Monte-Carlo Go

    • Jiao Wang, Shiyuan Li, Jitong Chen, Xin Wei, Huizhan Lv, Xinhe Xu
    Pages 108-120

  12. Temporal Difference Learning for Connect6

    • I-Chen Wu, Hsin-Ti Tsai, Hung-Hsuan Lin, Yi-Shan Lin, Chieh-Min Chang, Ping-Hung Lin
    Pages 121-133

  13. Improving Temporal Difference Learning Performance in Backgammon Variants

    • Nikolaos Papahristou, Ioannis Refanidis
    Pages 134-145

  14. CLOP: Confident Local Optimization for Noisy Black-Box Parameter Tuning

    • Rémi Coulom
    Pages 146-157

  15. Analysis of Evaluation-Function Learning by Comparison of Sibling Nodes

    • Tomoyuki Kaneko, Kunihito Hoki
    Pages 158-169

  16. Approximating Optimal Dudo Play with Fixed-Strategy Iteration Counterfactual Regret Minimization

    • Todd W. Neller, Steven Hnath
    Pages 170-183

  17. The Global Landscape of Objective Functions for the Optimization of Shogi Piece Values with a Game-Tree Search

    • Kunihito Hoki, Tomoyuki Kaneko
    Pages 184-195

  18. Solving breakthrough with Race Patterns and Job-Level Proof Number Search

    • Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave
    Pages 196-207

  19. Infinite Connect-Four Is Solved: Draw

    • Yoshiaki Yamaguchi, Kazunori Yamaguchi, Tetsuro Tanaka, Tomoyuki Kaneko
    Pages 208-219

  20. Blunder Cost in Go and Hex

    • Henry Brausen, Ryan B. Hayward, Martin Müller, Abdul Qadir, David Spies
    Pages 220-229
Back to top

Other volumes

  1. Advances in Computer Games

Keywords

About this book

This book constitutes the thoroughly refereed post-conference proceedings of the 13th Advances in Computer Games Conference, ACG 2011, held in Tilburg, The Netherlands, in November 2011. The 29 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers cover a wide range of topics such as Monte-Carlo tree search and its enhancement, temporal difference learning, optimization, solving and searching, analysis of a game characteristic, new approaches, and serious games.

Editors and Affiliations

  • Tilburg Institute of Cognition and Communication, Tilburg University, Tilburg, The Netherlands

    H. Jaap Herik, Aske Plaat

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation