Volume 252, Number 1-2, 6 February 2001
CG 1998
- H. Jaap van den Herik, Hiroyuki Iida:
Papers from CG 1998 - Foreword.
1-3
- Aviezri S. Fraenkel, Dmitri Zusman:
A new heap game.
5-12
- Aviezri S. Fraenkel, Ofer Rahat:
Infinite cyclic impartial games.
13-22
- William L. Spight:
Extended thermography for multiple kos in Go.
23-43
- Steven Willmott, Julian Richardson, Alan Bundy, John Levine:
Applying adversarial planning techniques to Go.
45-82
- 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
- Donald F. Beal, Martin C. Smith:
Temporal difference learning applied to game playing and the results of application to Shogi.
105-119
- 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
- Andreas Junghanns, Jonathan Schaeffer:
Sokoban: improving the search with relevance cuts.
151-175
- Yngvi Björnsson, T. Anthony Marsland:
Multi-cut alpha-beta-pruning in game-tree search.
177-196
- Wim Pijls, Arie de Bruin:
Game tree algorithms and solution trees.
197-215
- Ian Frank, David A. Basin:
A theoretical and empirical investigation of search in imperfect information games.
217-256
Last update Sat May 25 16:55:00 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
