default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 644
Volume 644, September 2016
- H. Jaap van den Herik
, Walter A. Kosters, Aske Plaat:
Recent Advances in Computer Games. 1
- Édouard Bonnet, Florian Jamain, Abdallah Saffidine:
On the complexity of connection games. 2-28 - Cameron Browne:
Algorithms for interactive Sprouts. 29-42 - Tristan Cazenave:
Playout policy adaptation with move features. 43-52 - Tobias Graf, Marco Platzner:
Adaptive playouts for online learning of policies during Monte Carlo Tree Search. 53-62 - Chu-Hsuan Hsueh, I-Chen Wu, Wen-Jie Tseng, Shi-Jim Yen, Jr-Chang Chen:
An analysis for strength improvement of an MCTS-based program playing Chinese dark chess. 63-75 - Vito Janko, Matej Guid:
A program for Progressive chess. 76-91 - Yun-Ching Liu, Yoshimasa Tsuruoka:
Modification of improved upper confidence bounds for regulating exploration in Monte-Carlo tree search. 92-105 - Richard Lorentz:
Using evaluation functions in Monte-Carlo Tree Search. 106-113 - Yusaku Mandai, Tomoyuki Kaneko:
LinUCB applied to Monte Carlo tree search. 114-126 - Jakub Pawlewicz, Ryan B. Hayward:
Conspiracy number search with relative sibling scores. 127-142 - Jos W. H. M. Uiterwijk:
Polymerization and crystallization of Snowflake molecules in Domineering. 143-158
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-21 19:21 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:
