Theoretical Computer Science, Volume 252

Volume 252, Number 1-2, 6 February 2001

• H. Jaap van den Herik, Hiroyuki Iida:
  Papers from CG 1998 - Foreword. 1-3
  Electronic Edition (link) BibTeX
• Aviezri S. Fraenkel, Dmitri Zusman:
  A new heap game. 5-12
  Electronic Edition (link) BibTeX
• Aviezri S. Fraenkel, Ofer Rahat:
  Infinite cyclic impartial games. 13-22
  Electronic Edition (link) BibTeX
• William L. Spight:
  Extended thermography for multiple kos in Go. 23-43
  Electronic Edition (link) BibTeX
• Steven Willmott, Julian Richardson, Alan Bundy, John Levine:
  Applying adversarial planning techniques to Go. 45-82
  Electronic Edition (link) BibTeX
• Xinbo Gao, Hiroyuki Iida, Jos W. H. M. Uiterwijk, H. Jaap van den Herik:
  Strategies anticipating a difference in search depth using opponent-model search. 83-104
  Electronic Edition (link) BibTeX
• Donald F. Beal, Martin C. Smith:
  Temporal difference learning applied to game playing and the results of application to Shogi. 105-119
  Electronic Edition (link) BibTeX
• Dennis M. Breuker, H. Jaap van den Herik, Jos W. H. M. Uiterwijk, L. Victor Allis:
  A solution to the GHI problem for best-first search. 121-149
  Electronic Edition (link) BibTeX
• Andreas Junghanns, Jonathan Schaeffer:
  Sokoban: improving the search with relevance cuts. 151-175
  Electronic Edition (link) BibTeX
• Yngvi Björnsson, T. Anthony Marsland:
  Multi-cut alpha-beta-pruning in game-tree search. 177-196
  Electronic Edition (link) BibTeX
• Wim Pijls, Arie de Bruin:
  Game tree algorithms and solution trees. 197-215
  Electronic Edition (link) BibTeX
• Ian Frank, David A. Basin:
  A theoretical and empirical investigation of search in imperfect information games. 217-256
  Electronic Edition (link) BibTeX