Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical 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 - 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
a service of 
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 2024-04-18 20:20 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:
