default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6. CG 2006: Turin, Italy
- H. Jaap van den Herik, Paolo Ciancarini
, H. H. L. M. Donkers:
Computers and Games, 5th International Conference, CG 2006, Turin, Italy, May 29-31, 2006. Revised Papers. Lecture Notes in Computer Science 4630, Springer 2007, ISBN 978-3-540-75537-1 - Matej Guid, Ivan Bratko:
Computer Analysis of Chess Champions. 1-12 - Aleksander Sadikov, Martin Mozina, Matej Guid, Jana Krivec, Ivan Bratko:
Automated Chess Tutor. 13-25 - Keh-Hsun Chen, Peigang Zhang:
A New Heuristic Search Algorithm for Capturing Problems in Go. 26-36 - Xiaozhen Niu, Martin Müller:
An Open Boundary Safety-of-Territory Solver for the Game of Go. 37-49 - Jahn-Takeshi Saito, Guillaume Chaslot, Jos W. H. M. Uiterwijk, H. Jaap van den Herik:
Monte-Carlo Proof-Number Search for Computer Go. 50-61 - Tristan Cazenave:
Virtual Global Search: Application to 9×9 Go. 62-71 - Rémi Coulom:
Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. 72-83 - John Tromp, Gunnar Farnebäck:
Combinatorics of Go. 84-99 - Bo-Nian Chen, Pangfeng Liu, Shun-chin Hsu, Tsan-sheng Hsu:
Abstracting Knowledge from Annotated Chinese-Chess Game Records. 100-111 - Ryan B. Hayward, Broderick Arneson, Philip Henderson:
Automatic Strategy Verification for Hex. 112-121 - Nathan R. Sturtevant, Adam M. White:
Feature Construction for Reinforcement Learning in Hearts. 122-134 - Sebastian Kupferschmid, Malte Helmert:
A Skat Player Based on Monte-Carlo Simulation. 135-147 - James Glenn, Haw-ren Fang, Clyde P. Kruskal:
A Retrograde Approximation Algorithm for One-Player Can't Stop. 148-159 - Jakub Pawlewicz, Lukasz Lew:
Improving Depth-First PN-Search: 1 + epsilon Trick. 160-171 - Aleksander Sadikov, Ivan Bratko:
Search Versus Knowledge Revisited Again. 172-180 - Alessandro Cincotti:
Counting the Number of Three-Player Partizan Cold Games. 181-189 - Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman:
LUMINESStrategies. 190-199 - Peter Bro Miltersen, Troels Bjerre Sørensen:
Computing Proper Equilibria of Zero-Sum Games. 200-211 - Cherif R. S. Andraos, Manal M. Zaky, Salma A. Ghoneim:
Comparative Study of Approximate Strategies for Playing Sum Games Based on Subgame Types. 212-219 - Sébastien Collette, Jean-François Raskin, Frédéric Servais:
On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game. 220-233 - Shunsaku Kato, Shuichi Miyazaki, Yusuke Nishimura, Yasuo Okabe:
Cheat-Proof Serverless Network Games. 234-243 - Will Leckie, Michael A. Greenspan:
Monte-Carlo Methods in Pool Strategy Game Trees. 244-255 - Jean-Pierre Dussault, Jean-François Landry:
Optimization of a Billiard Player - Tactical Play. 256-270 - Lizette de Wet, Theo McDonald:
Gender and Cultural Differences (If Any!): South African School Children and Computer Games. 271-282
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-10-22 02:19 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
