Abstract is missing.
- Accelerated UCT and Its Application to Two-Player GamesJunichi Hashimoto, Akihiro Kishimoto, Kazuki Yoshizoe, Kokolo Ikeda. 1-12 [doi]
- Revisiting Move Groups in Monte-Carlo Tree SearchGabriel Van Eyck, Martin Müller 0003. 13-23 [doi]
- PACHI: State of the Art Open Source Go ProgramPetr Baudis, Jean-Loup Gailly. 24-38 [doi]
- Time Management for Monte-Carlo Tree Search in GoHendrik Baier, Mark H. M. Winands. 39-51 [doi]
- An MCTS Program to Play EinStein Würfelt Nicht!Richard J. Lorentz. 52-59 [doi]
- Monte-Carlo Tree Search Enhancements for HavannahJan A. Stankiewicz, Mark H. M. Winands, Jos W. H. M. Uiterwijk. 60-71 [doi]
- Playout Search for Monte-Carlo Tree Search in Multi-player GamesJ. (Pim) A. M. Nijssen, Mark H. M. Winands. 72-83 [doi]
- Towards a Solution of 7x7 Go with Meta-MCTSCheng-Wei Chou, Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Tsan-Cheng Su, Fabien Teytaud, Olivier Teytaud, Hui Min Wang, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen. 84-95 [doi]
- MCTS Experiments on the Voronoi GameBruno Bouzy, Marc Métivier, Damien Pellier. 96-107 [doi]
- 4*4-Pattern and Bayesian Learning in Monte-Carlo GoJiao Wang, Shiyuan Li, Jitong Chen, Xin Wei, Huizhan Lv, Xinhe Xu. 108-120 [doi]
- Temporal Difference Learning for Connect6I-Chen Wu, Hsin-Ti Tsai, Hung-Hsuan Lin, Yi-Shan Lin, Chieh-Min Chang, Ping-Hung Lin. 121-133 [doi]
- Improving Temporal Difference Learning Performance in Backgammon VariantsNikolaos Papahristou, Ioannis Refanidis. 134-145 [doi]
- CLOP: Confident Local Optimization for Noisy Black-Box Parameter TuningRémi Coulom. 146-157 [doi]
- Analysis of Evaluation-Function Learning by Comparison of Sibling NodesTomoyuki Kaneko, Kunihito Hoki. 158-169 [doi]
- Approximating Optimal Dudo Play with Fixed-Strategy Iteration Counterfactual Regret MinimizationTodd W. Neller, Steven Hnath. 170-183 [doi]
- The Global Landscape of Objective Functions for the Optimization of Shogi Piece Values with a Game-Tree SearchKunihito Hoki, Tomoyuki Kaneko. 184-195 [doi]
- Solving breakthrough with Race Patterns and Job-Level Proof Number SearchAbdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave. 196-207 [doi]
- Infinite Connect-Four Is Solved: DrawYoshiaki Yamaguchi, Kazunori Yamaguchi, Tetsuro Tanaka, Tomoyuki Kaneko. 208-219 [doi]
- Blunder Cost in Go and HexHenry Brausen, Ryan B. Hayward, Martin Müller 0003, Abdul Qadir, David Spies. 220-229 [doi]
- Understanding Distributions of Chess PerformancesKenneth W. Regan, Bartlomiej Macieja, Guy McCrossan Haworth. 230-243 [doi]
- Position Criticality in Chess EndgamesGuy McCrossan Haworth, Á. Rusz. 244-257 [doi]
- On Board-Filling Games with Random-Turn Order and Monte Carlo PerfectnessIngo Althöfer. 258-269 [doi]
- Modeling Games with the Help of Quantified Integer Linear ProgramsThorsten Ederer, Ulf Lorenz, Thomas Opfer, Jan Wolf. 270-281 [doi]
- Computing Strong Game-Theoretic Strategies in JottoSam Ganzfried. 282-294 [doi]
- Online Sparse Bandit for Card GamesDavid Lupien St-Pierre, Quentin Louveaux, Olivier Teytaud. 295-305 [doi]
- Game Tree Search with Adaptive ResolutionHung-Jui Chang, Meng-Tsung Tsai, Tsan-sheng Hsu. 306-319 [doi]
- Designing Casanova: A Language for GamesGiuseppe Maggiore, Alvise Spanò, Renzo Orsini, Giulia Costantini, Michele Bugliesi, Mohamed Abbadi. 320-332 [doi]
- Affective Game Dialogues - Using Affect as an Explicit Input Method in Game Dialogue SystemsMichael Lankes, Thomas Mirlacher. 333-341 [doi]
- Generating Believable Virtual Characters Using Behavior Capture and Hidden Markov ModelsRichard Zhao, Duane Szafron. 342-353 [doi]