default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8. CG 2013: Yokohama, Japan
- H. Jaap van den Herik, Hiroyuki Iida, Aske Plaat:
Computers and Games - 8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8427, Springer 2014, ISBN 978-3-319-09164-8 - I-Chen Wu
, Hao-Hua Kang, Hung-Hsuan Lin, Ping-Hung Lin, Ting-Han Wei, Chieh-Min Chang:
Dependency-Based Search for Connect6. 1-13 - Tobias Graf, Lars Schaefers, Marco Platzner:
On Semeai Detection in Monte-Carlo Go. 14-25 - Kokolo Ikeda, Simon Viennot:
Efficiency of Static Knowledge Bias in Monte-Carlo Tree Search. 26-38 - Shih-Chieh Huang, Martin Müller:
Investigating the Limits of Monte-Carlo Tree Search Methods in Computer Go. 39-48 - Richard Lorentz, Therese Horey:
Programming Breakthrough. 49-59 - Shih-Chieh Huang, Broderick Arneson, Ryan B. Hayward, Martin Müller, Jakub Pawlewicz:
MoHex 2.0: A Pattern-Based MCTS Hex Player. 60-71 - Sumudu Fernando, Martin Müller:
Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go. 72-83 - Ingo Althöfer, Wesley Michael Turner:
Anomalies of Pure Monte-Carlo Search in Monte-Carlo Perfect Games. 84-99 - Abdallah Saffidine, Tristan Cazenave:
Developments on Product Propagation. 100-109 - Ulf Lorenz, Thomas Opfer, Jan Wolf:
Solution Techniques for Quantified Linear Programs and the Links to Gaming. 110-124 - Markus Esser, Michael Gras, Mark H. M. Winands, Maarten P. D. Schadd, Marc Lanctot:
Improving Best-Reply Search. 125-137 - Jakub Pawlewicz, Ryan B. Hayward:
Scalable Parallel DFPN Search. 138-150 - Hung-Jui Chang, Tsan-sheng Hsu:
A Quantitative Study of 2 \times 4 2 × 4 Chinese Dark Chess. 151-162 - Yoshiaki Yamaguchi, Tetsuro Tanaka, Kazunori Yamaguchi:
Cylinder-Infinite-Connect-Four Except for Widths 2, 6, and 11 Is Solved: Draw. 163-174 - Edouard Bonnet, Florian Jamain, Abdallah Saffidine:
Havannah and TwixT are PSPACE-complete. 175-186 - Abdallah Saffidine, Nicolas Jouandeau, Cédric L. R. Buron, Tristan Cazenave:
Material Symmetry to Partition Endgame Tables. 187-198 - Kristian Toby Spoerer, Toshihisa Okaneya, Kokolo Ikeda, Hiroyuki Iida:
Further Investigations of 3-Member Simple Majority Voting for Chess. 199-207 - Akira Ura, Makoto Miwa, Yoshimasa Tsuruoka, Takashi Chikayama:
Comparison Training of Shogi Evaluation Functions with Self-Generated Training Positions and Moves. 208-220 - Bo-Nian Chen, Tsan-sheng Hsu:
Automatic Generation of Opening Books for Dark Chess. 221-232 - Todd W. Neller, Marcin Malec, Clifton G. M. Presser, Forrest Jacobs:
Optimal, Approximately Optimal, and Fair Play of the Fowl Play Card Game. 233-243 - Mohamed Abbadi, Francesco Di Giacomo, Renzo Orsini, Aske Plaat, Pieter Spronck, Giuseppe Maggiore:
Resource Entity Action: A Generalized Design Pattern for RTS Games. 244-256
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 2026-07-28 23:26 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
