default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6. CG 2010: Kanazawa, Japan
- H. Jaap van den Herik, Hiroyuki Iida, Aske Plaat:
Computers and Games - 7th International Conference, CG 2010, Kanazawa, Japan, September 24-26, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6515, Springer 2011, ISBN 978-3-642-17927-3 - Broderick Arneson, Ryan B. Hayward, Philip Henderson:
Solving Hex: Beyond Humans. 1-10 - I-Chen Wu
, Hung-Hsuan Lin, Ping-Hung Lin, Der-Johng Sun, Yi-Chih Chan, Bo-Ting Chen:
Job-Level Proof-Number Search for Connect6. 11-22 - Mark H. M. Winands, Maarten P. D. Schadd:
Evaluation-Function Based Proof-Number Search. 23-35 - Richard B. Segal:
On the Scalability of Parallel UCT. 36-47 - Amine Bourki, Guillaume Chaslot, Matthieu Coulm, Vincent Danjean, Hassen Doghmen, Jean-Baptiste Hoock, Thomas Hérault, Arpad Rimmel, Fabien Teytaud, Olivier Teytaud, Paul Vayssière, Ziqin Yut:
Scalability and Parallelization of Monte-Carlo Tree Search. 48-58 - Arpad Rimmel, Fabien Teytaud, Olivier Teytaud:
Biasing Monte-Carlo Simulations through RAVE Values. 59-68 - David Tom, Martin Müller:
Computational Experiments with the RAVE Heuristic. 69-80 - Shih-Chieh Huang, Rémi Coulom, Shun-Shii Lin:
Monte-Carlo Simulation Balancing in Practice. 81-92 - Tristan Cazenave, Abdallah Saffidine:
Score Bounded Monte-Carlo Tree Search. 93-104 - Richard J. Lorentz:
Improving Monte-Carlo Tree Search in Havannah. 105-115 - Takayuki Yajima, Tsuyoshi Hashimoto, Toshiki Matsui, Junichi Hashimoto, Kristian Spoerer:
Node-Expansion Operators for the UCT Algorithm. 116-123 - Julien Kloetzer:
Monte-Carlo Opening Books for Amazons. 124-135 - Romaric Gaudel, Jean-Baptiste Hoock, Julien Perez, Nataliya Sokolovska, Olivier Teytaud:
A Principled Method for Exploiting Opening Books. 136-144 - Darren Cook:
A Human-Computer Team Experiment for 9x9 Go. 145-155 - Takuya Obata, Takuya Sugiyama, Kunihito Hoki, Takeshi Ito:
Consultation Algorithm for Computer Shogi: Move Decisions by Majority. 156-165 - Takuya Sugiyama, Takuya Obata, Kunihito Hoki, Takeshi Ito:
Optimistic Selection Rule Better Than Majority Voting System. 166-175 - Bo-Nian Chen, Pangfeng Liu, Shun-chin Hsu, Tsan-sheng Hsu:
Knowledge Abstraction in Chinese Chess Endgame Databases. 176-187 - Todd W. Neller, Adrian Fisher, Munyaradzi T. Choga, Samir M. Lalvani, Kyle D. McCarty:
Rook Jumping Maze Design Considerations. 188-198 - Stéphane Cardon, Nathalie Chetcuti-Sperandio, Fabien Delorme, Sylvain Lagrue:
A Markovian Process Modeling for Pickomino. 199-210 - Sahil Bahri, Clyde P. Kruskal:
New Solutions for Synchronized Domineering. 211-229 - Alessandro Cincotti:
The Lattice Structure of Three-Player Games. 230-237 - J. (Pim) A. M. Nijssen, Mark H. M. Winands:
Enhancements for Multi-Player Monte-Carlo Tree Search. 238-249 - Jakub Pawlewicz:
Nearly Optimal Computer Play in Multi-player Yahtzee. 250-262 - Giel van Lankveld, Sonny Schreurs, Pieter Spronck, H. Jaap van den Herik:
Extraversion in Games. 263-275
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-03-10 20:52 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:
