Book — 1 online resource (xxi, 356 pages) : illustrations Digital: text file.PDF.
Accelerated UCT and Its Application to Two-Player Games / Junichi Hashimoto, Akihiro Kishimoto, Kazuki Yoshizoe and Kokolo Ikeda
Revisiting Move Groups in Monte-Carlo Tree Search / Gabriel Van Eyck and Martin Müller
PACHI: State of the Art Open Source Go Program / Petr Baudiš and Jean-loup Gailly
Time Management for Monte-Carlo Tree Search in Go / Hendrik Baier and Mark H.M. Winands
An MCTS Program to Play EinStein Würfelt Nicht! / Richard J. Lorentz
Monte-Carlo Tree Search Enhancements for Havannah / Jan A. Stankiewicz, Mark H.M. Winands and Jos W.H.M. Uiterwijk
Playout Search for Monte-Carlo Tree Search in Multi-player Games / J. (Pim) A.M. Nijssen and Mark H.M. Winands
Towards a Solution of 7x7 Go with Meta-MCTS / Cheng-Wei Chou, Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee and Tsan-Cheng Su, et al.
MCTS Experiments on the Voronoi Game / Bruno Bouzy, Marc Métivier and Damien Pellier
4*4-Pattern and Bayesian Learning in Monte-Carlo Go / Jiao Wang, Shiyuan Li, Jitong Chen, Xin Wei and Huizhan Lv, et al.
Temporal Difference Learning for Connect6 / I-Chen Wu, Hsin-Ti Tsai, Hung-Hsuan Lin, Yi-Shan Lin and Chieh-Min Chang, et al.
Improving Temporal Difference Learning Performance in Backgammon Variants / Nikolaos Papahristou and Ioannis Refanidis
CLOP: Confident Local Optimization for Noisy Black-Box Parameter Tuning / Rémi Coulom
Analysis of Evaluation-Function Learning by Comparison of Sibling Nodes / Tomoyuki Kaneko and Kunihito Hoki
Approximating Optimal Dudo Play with Fixed-Strategy Iteration Counterfactual Regret Minimization / Todd W. Neller and Steven Hnath
The Global Landscape of Objective Functions for the Optimization of Shogi Piece Values with a Game-Tree Search / Kunihito Hoki and Tomoyuki Kaneko
Solving breakthrough with Race Patterns and Job-Level Proof Number Search / Abdallah Saffidine, Nicolas Jouandeau and Tristan Cazenave
Infinite Connect-Four Is Solved: Draw / Yoshiaki Yamaguchi, Kazunori Yamaguchi, Tetsuro Tanaka and Tomoyuki Kaneko
Blunder Cost in Go and Hex / Henry Brausen, Ryan B. Hayward, Martin Müller, Abdul Qadir and David Spies
Understanding Distributions of Chess Performances / Kenneth W. Regan, Bartlomiej Macieja and Guy McC. Haworth
Position Criticality in Chess Endgames / Guy McC. Haworth and Á. Rusz
On Board-Filling Games with Random-Turn Order and Monte Carlo Perfectness / Ingo Althöfer
Modeling Games with the Help of Quantified Integer Linear Programs / Thorsten Ederer, Ulf Lorenz, Thomas Opfer and Jan Wolf
Computing Strong Game-Theoretic Strategies in Jotto / Sam Ganzfried
Online Sparse Bandit for Card Games / David L. St-Pierre, Quentin Louveaux and Olivier Teytaud
Game Tree Search with Adaptive Resolution / Hung-Jui Chang, Meng-Tsung Tsai and Tsan-sheng Hsu
Designing Casanova: A Language for Games / Giuseppe Maggiore, Alvise Spanò, Renzo Orsini, Giulia Costantini and Michele Bugliesi, et al.
Affective Game Dialogues / Using Affect as an Explicit Input Method in Game Dialogue Systems / Michael Lankes and Thomas Mirlacher
Generating Believable Virtual Characters Using Behavior Capture and Hidden Markov Models / Richard Zhao and Duane Szafron.
Annotation 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.
Book — 1 online resource (xviii, 275 pages) : illustrations Digital: text file; PDF.
This book constitutes the refereed proceedings of the 7th International Conference on Computers and Games, CG 2010, held in Kanazawa, Japan, in September 2010. The 24 papers presented were carefully reviewed and selected for inclusion in this book. They cover a wide range of topics such as monte-carlo tree search, proof-number search, UCT algorithm, scalability, parallelization, opening books, knowledge abstraction, solving games, consultation of players, multi-player games, extraversion, and combinatorial game theory. In addition a wide range of computer games is dealt with, such as Chinese Checkers, Chinese Chess, Connect6, Go, Havannah, Lines of Action, Pckomino, Shogi, Surakarta, and Yahtzee. (source: Nielsen Book Data)