default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACG 2015: Leiden, The Netherlands
- Aske Plaat, H. Jaap van den Herik
, Walter A. Kosters:
Advances in Computer Games - 14th International Conference, ACG 2015, Leiden, The Netherlands, July 1-3, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9525, Springer 2015, ISBN 978-3-319-27991-6 - Tobias Graf, Marco Platzner:
Adaptive Playouts in Monte-Carlo Tree Search with Policy-Gradient Reinforcement Learning. 1-11 - Richard Lorentz:
Early Playout Termination in MCTS. 12-19 - Tristan Cazenave:
Playout Policy Adaptation for Games. 20-28 - Chu-Hsuan Hsueh, I-Chen Wu, Wen-Jie Tseng, Shi-Jim Yen, Jr-Chang Chen:
Strength Improvement and Analysis for an MCTS-Based Chinese Dark Chess Program. 29-40 - Yusaku Mandai, Tomoyuki Kaneko:
LinUCB Applied to Monte-Carlo Tree Search. 41-52 - Yun-Ching Liu, Yoshimasa Tsuruoka:
Adapting Improved Upper Confidence Bounds for Monte-Carlo Tree Search. 53-64 - Ingo Althöfer, Matthias Beckmann, Friedrich Salzer:
On Some Random Walk Games with Diffusion Control. 65-75 - Abdallah Saffidine, Olivier Teytaud, Shi-Jim Yen:
Go Complexities. 76-88 - Matthias Beckmann:
On Some Evacuation Games with Random Walks. 89-99 - Jos W. H. M. Uiterwijk:
Crystallization of Domineering Snowflakes. 100-112 - Yoshiaki Yamaguchi, Todd W. Neller:
First Player's Cannot-Lose Strategies for Cylinder-Infinite-Connect-Four with Widths 2 and 6. 113-121 - Vito Janko, Matej Guid:
Development of a Program for Playing Progressive Chess. 122-134 - Guy Haworth, Tamal Biswas, Kenneth W. Regan:
A Comparative Review of Skill Assessment: Performance, Prediction and Profiling. 135-146 - Cameron Browne:
Boundary Matching for Interactive Sprouts. 147-159 - Edouard Bonnet, Florian Jamain, Abdallah Saffidine:
Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game. 160-176 - Nikolaos Papahristou, Ioannis Refanidis:
Constructing Pin Endgame Databases for the Backgammon Variant Plakoto. 177-184 - Taichi Ishitobi, Aske Plaat, Hiroyuki Iida, H. Jaap van den Herik:
Reducing the Seesaw Effect with Deep Proof-Number Search. 185-197 - Jakub Pawlewicz, Ryan B. Hayward:
Feature Strength and Parallelization of Sibling Conspiracy Number Search. 198-209 - Shu Yokoyama, Tomoyuki Kaneko, Tetsuro Tanaka:
Parameter-Free Tree Style Pipeline in Asynchronous Parallel Game-Tree Search. 210-222 - Yuichiro Sato, Hiroyuki Iida, H. Jaap van den Herik:
Transfer Learning by Inductive Logic Programming. 223-234 - Kei Takada, Masaya Honjo, Hiroyuki Iizuka, Masahito Yamamoto:
Developing Computer Hex Using Global and Local Evaluation Based on Board Network Characteristics. 235-246 - Kokolo Ikeda, Takanari Shishido, Simon Viennot:
Machine-Learning of Shape Names for the Game of Go. 247-259
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 2025-02-05 20:18 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:
