6. CG 2006: Turin, Italy

• Matej Guid, Ivan Bratko:
  Computer Analysis of Chess Champions. 1-12
  Electronic Edition (link) BibTeX
• Aleksander Sadikov, Martin Mozina, Matej Guid, Jana Krivec, Ivan Bratko:
  Automated Chess Tutor. 13-25
  Electronic Edition (link) BibTeX
• Keh-Hsun Chen, Peigang Zhang:
  A New Heuristic Search Algorithm for Capturing Problems in Go. 26-36
  Electronic Edition (link) BibTeX
• Xiaozhen Niu, Martin Müller:
  An Open Boundary Safety-of-Territory Solver for the Game of Go. 37-49
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX
• Tristan Cazenave:
  Virtual Global Search: Application to 9×9 Go. 62-71
  Electronic Edition (link) BibTeX
• Rémi Coulom:
  Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. 72-83
  Electronic Edition (link) BibTeX
• John Tromp, Gunnar Farnebäck:
  Combinatorics of Go. 84-99
  Electronic Edition (link) BibTeX
• Bo-Nian Chen, Pangfeng Liu, Shun-chin Hsu, Tsan-sheng Hsu:
  Abstracting Knowledge from Annotated Chinese-Chess Game Records. 100-111
  Electronic Edition (link) BibTeX
• Ryan B. Hayward, Broderick Arneson, Philip Henderson:
  Automatic Strategy Verification for Hex. 112-121
  Electronic Edition (link) BibTeX
• Nathan R. Sturtevant, Adam M. White:
  Feature Construction for Reinforcement Learning in Hearts. 122-134
  Electronic Edition (link) BibTeX
• Sebastian Kupferschmid, Malte Helmert:
  A Skat Player Based on Monte-Carlo Simulation. 135-147
  Electronic Edition (link) BibTeX
• James Glenn, Haw-ren Fang, Clyde P. Kruskal:
  A Retrograde Approximation Algorithm for One-Player Can't Stop. 148-159
  Electronic Edition (link) BibTeX
• Jakub Pawlewicz, Lukasz Lew:
  Improving Depth-First PN-Search: 1 + epsilon Trick. 160-171
  Electronic Edition (link) BibTeX
• Aleksander Sadikov, Ivan Bratko:
  Search Versus Knowledge Revisited Again. 172-180
  Electronic Edition (link) BibTeX
• Alessandro Cincotti:
  Counting the Number of Three-Player Partizan Cold Games. 181-189
  Electronic Edition (link) BibTeX
• Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman:
  LUMINESStrategies. 190-199
  Electronic Edition (link) BibTeX
• Peter Bro Miltersen, Troels Bjerre Sørensen:
  Computing Proper Equilibria of Zero-Sum Games. 200-211
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX
• Shunsaku Kato, Shuichi Miyazaki, Yusuke Nishimura, Yasuo Okabe:
  Cheat-Proof Serverless Network Games. 234-243
  Electronic Edition (link) BibTeX
• Will Leckie, Michael A. Greenspan:
  Monte-Carlo Methods in Pool Strategy Game Trees. 244-255
  Electronic Edition (link) BibTeX
• Jean-Pierre Dussault, Jean-François Landry:
  Optimization of a Billiard Player - Tactical Play. 256-270
  Electronic Edition (link) BibTeX
• Lizette de Wet, Theo McDonald:
  Gender and Cultural Differences (If Any!): South African School Children and Computer Games. 271-282
  Electronic Edition (link) BibTeX