default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACG 2011: Tilburg, The Netherlands
- H. Jaap van den Herik, Aske Plaat:
Advances in Computer Games - 13th International Conference, ACG 2011, Tilburg, The Netherlands, November 20-22, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7168, Springer 2012, ISBN 978-3-642-31865-8 - Junichi Hashimoto, Akihiro Kishimoto, Kazuki Yoshizoe, Kokolo Ikeda:
Accelerated UCT and Its Application to Two-Player Games. 1-12 - Gabriel Van Eyck, Martin Müller:
Revisiting Move Groups in Monte-Carlo Tree Search. 13-23 - Petr Baudis, Jean-Loup Gailly:
PACHI: State of the Art Open Source Go Program. 24-38 - Hendrik Baier, Mark H. M. Winands
:
Time Management for Monte-Carlo Tree Search in Go. 39-51 - Richard J. Lorentz:
An MCTS Program to Play EinStein Würfelt Nicht! 52-59 - Jan A. Stankiewicz, Mark H. M. Winands, Jos W. H. M. Uiterwijk:
Monte-Carlo Tree Search Enhancements for Havannah. 60-71 - J. (Pim) A. M. Nijssen, Mark H. M. Winands:
Playout Search for Monte-Carlo Tree Search in Multi-player Games. 72-83 - Cheng-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:
Towards a Solution of 7x7 Go with Meta-MCTS. 84-95 - Bruno Bouzy, Marc Métivier, Damien Pellier:
MCTS Experiments on the Voronoi Game. 96-107 - Jiao Wang, Shiyuan Li, Jitong Chen, Xin Wei, Huizhan Lv, Xinhe Xu:
4*4-Pattern and Bayesian Learning in Monte-Carlo Go. 108-120 - I-Chen Wu, Hsin-Ti Tsai, Hung-Hsuan Lin, Yi-Shan Lin, Chieh-Min Chang, Ping-Hung Lin:
Temporal Difference Learning for Connect6. 121-133 - Nikolaos Papahristou, Ioannis Refanidis:
Improving Temporal Difference Learning Performance in Backgammon Variants. 134-145 - Rémi Coulom:
CLOP: Confident Local Optimization for Noisy Black-Box Parameter Tuning. 146-157 - Tomoyuki Kaneko, Kunihito Hoki:
Analysis of Evaluation-Function Learning by Comparison of Sibling Nodes. 158-169 - Todd W. Neller, Steven Hnath:
Approximating Optimal Dudo Play with Fixed-Strategy Iteration Counterfactual Regret Minimization. 170-183 - Kunihito Hoki, Tomoyuki Kaneko:
The Global Landscape of Objective Functions for the Optimization of Shogi Piece Values with a Game-Tree Search. 184-195 - Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave:
Solving breakthrough with Race Patterns and Job-Level Proof Number Search. 196-207 - Yoshiaki Yamaguchi, Kazunori Yamaguchi, Tetsuro Tanaka, Tomoyuki Kaneko:
Infinite Connect-Four Is Solved: Draw. 208-219 - Henry Brausen, Ryan B. Hayward, Martin Müller, Abdul Qadir, David Spies:
Blunder Cost in Go and Hex. 220-229 - Kenneth W. Regan, Bartlomiej Macieja, Guy McCrossan Haworth:
Understanding Distributions of Chess Performances. 230-243 - Guy McCrossan Haworth, Á. Rusz:
Position Criticality in Chess Endgames. 244-257 - Ingo Althöfer:
On Board-Filling Games with Random-Turn Order and Monte Carlo Perfectness. 258-269 - Thorsten Ederer, Ulf Lorenz, Thomas Opfer, Jan Wolf:
Modeling Games with the Help of Quantified Integer Linear Programs. 270-281 - Sam Ganzfried:
Computing Strong Game-Theoretic Strategies in Jotto. 282-294 - David Lupien St-Pierre, Quentin Louveaux, Olivier Teytaud:
Online Sparse Bandit for Card Games. 295-305 - Hung-Jui Chang, Meng-Tsung Tsai, Tsan-sheng Hsu:
Game Tree Search with Adaptive Resolution. 306-319 - Giuseppe Maggiore, Alvise Spanò, Renzo Orsini, Giulia Costantini, Michele Bugliesi, Mohamed Abbadi:
Designing Casanova: A Language for Games. 320-332 - Michael Lankes, Thomas Mirlacher:
Affective Game Dialogues - Using Affect as an Explicit Input Method in Game Dialogue Systems. 333-341 - Richard Zhao, Duane Szafron:
Generating Believable Virtual Characters Using Behavior Capture and Hidden Markov Models. 342-353
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-08 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
