Skip to main content
SpringerLink
Log in
Book cover

Computers and Games

8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. H. Jaap van den Herik

    1. Tilburg University, Tilburg, The Netherlands

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Hiroyuki Iida

    1. JAIST, Ishikawa, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Aske Plaat

    1. Tilburg University, Tilburg, The Netherlands

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: CG 2013.

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 EPUB and 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 (21 papers)

  1. Front Matter

    Pages I-XX
    Download chapter PDF

  2. Dependency-Based Search for Connect6

    • I-Chen Wu, Hao-Hua Kang, Hung-Hsuan Lin, Ping-Hung Lin, Ting-Han Wei, Chieh-Min Chang
    Pages 1-13

  3. On Semeai Detection in Monte-Carlo Go

    • Tobias Graf, Lars Schaefers, Marco Platzner
    Pages 14-25

  4. Efficiency of Static Knowledge Bias in Monte-Carlo Tree Search

    • Kokolo Ikeda, Simon Viennot
    Pages 26-38

  5. Investigating the Limits of Monte-Carlo Tree Search Methods in Computer Go

    • Shih-Chieh Huang, Martin Müller
    Pages 39-48

  6. Programming Breakthrough

    • Richard Lorentz, Therese Horey
    Pages 49-59

  7. MoHex 2.0: A Pattern-Based MCTS Hex Player

    • Shih-Chieh Huang, Broderick Arneson, Ryan B. Hayward, Martin Müller, Jakub Pawlewicz
    Pages 60-71

  8. Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go

    • Sumudu Fernando, Martin Müller
    Pages 72-83

  9. Anomalies of Pure Monte-Carlo Search in Monte-Carlo Perfect Games

    • Ingo Althöfer, Wesley Michael Turner
    Pages 84-99

  10. Developments on Product Propagation

    • Abdallah Saffidine, Tristan Cazenave
    Pages 100-109

  11. Solution Techniques for Quantified Linear Programs and the Links to Gaming

    • Ulf Lorenz, Thomas Opfer, Jan Wolf
    Pages 110-124

  12. Improving Best-Reply Search

    • Markus Esser, Michael Gras, Mark H. M. Winands, Maarten P. D. Schadd, Marc Lanctot
    Pages 125-137

  13. Scalable Parallel DFPN Search

    • Jakub Pawlewicz, Ryan B. Hayward
    Pages 138-150

  14. A Quantitative Study of \(2 \times 4\) Chinese Dark Chess

    • Hung-Jui Chang, Tsan-sheng Hsu
    Pages 151-162

  15. Cylinder-Infinite-Connect-Four Except for Widths 2, 6, and 11 Is Solved: Draw

    • Yoshiaki Yamaguchi, Tetsuro Tanaka, Kazunori Yamaguchi
    Pages 163-174

  16. Havannah and TwixT are PSPACE-complete

    • Édouard Bonnet, Florian Jamain, Abdallah Saffidine
    Pages 175-186

  17. Material Symmetry to Partition Endgame Tables

    • Abdallah Saffidine, Nicolas Jouandeau, Cédric Buron, Tristan Cazenave
    Pages 187-198

  18. Further Investigations of 3-Member Simple Majority Voting for Chess

    • Kristian Toby Spoerer, Toshihisa Okaneya, Kokolo Ikeda, Hiroyuki Iida
    Pages 199-207

  19. Comparison Training of Shogi Evaluation Functions with Self-Generated Training Positions and Moves

    • Akira Ura, Makoto Miwa, Yoshimasa Tsuruoka, Takashi Chikayama
    Pages 208-220

  20. Automatic Generation of Opening Books for Dark Chess

    • Bo-Nian Chen, Tsan-sheng Hsu
    Pages 221-232
Back to top

Other volumes

  1. Computers and Games

Keywords

About this book

This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Conference on Computers and Games, CG 2013, held in Yokohama, Japan, in August 2013, in conjunction with the 17th Computer and Games Tournament and the 20th World Computer-Chess Championship. The 21 papers presented were carefully reviewed and selected for inclusion in this book. They cover a wide range of topics which are grouped into five classes: Monte Carlo Tree Search and its enhancements; solving and searching; analysis of game characteristic; new approaches; and serious games.

Editors and Affiliations

  • Tilburg University, Tilburg, The Netherlands

    H. Jaap van den Herik, Aske Plaat

  • JAIST, Ishikawa, Japan

    Hiroyuki Iida

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation