2. CG 2000: Hamamatsu, Japan

T. Anthony Marsland, Ian Frank (Eds.): Computers and Games, Second International Conference, CG 2000, Hamamatsu, Japan, October 26-28, 2000, Revised Papers. Lecture Notes in Computer Science 2063 Springer 2002, ISBN 3-540-43080-6

@proceedings{DBLP:conf/cg/2000,
  editor    = {T. Anthony Marsland and
               Ian Frank},
  title     = {Computers and Games, Second International Conference, CG 2000,
               Hamamatsu, Japan, October 26-28, 2000, Revised Papers},
  booktitle = {Computers and Games},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2063},
  year      = {2002},
  isbn      = {3-540-43080-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Search and Strategies

Paul E. Utgoff, Richard P. Cochran:
A Least-Certainty Heuristic for Selective Search. 1-18
Thomas Thomsen:
Lambda-Search in Game Trees - with Application to Go. 19-38
Tristan Cazenave:
Abstract Proof Search. 39-54
Makoto Sakuta, Hiroyuki Iida:
Solving Kriegspiel-Like Problems: Examining Efficient Search Methods. 55-73
Thomas R. Lincke:
Strategies for the Automatic Construction of Opening Books. 74-86
Roel van der Goot:
Awari Retrograde Analysis. 87-95
Haw-ren Fang, Tsan-sheng Hsu, Shun-chin Hsu:
Construction of Chinese Chess Endgame Databases by Retrograde Analysis. 96-114

Learning and Pattern Acquisition

Jack van Rijswijck:
Learning from Perfection. A Data Mining Approach to Evaluation Function Learning in Awari. 115-132
Robert Levinson, Ryan Weber:
Chess Neighborhoods, Function Combination, and Reinforcement Learning. 133-150
Jan Ramon, Tom Francis, Hendrik Blockeel:
Learning a Go Heuristic with TILDE. 151-169
Levente Kocsis, Jos W. H. M. Uiterwijk, H. Jaap van den Herik:
Learning Time Allocation Using Neural Networks. 170-185

Theory and Complexity Issues

Wolfgang Slany:
The Complexity of Graph Ramsey Games. 186-203
Aviezri S. Fraenkel:
Virus Versus Mankind. 204-213
Richard J. Lorentz:
Creating Difficult Instances of the Post Correspondence Problem. 214-228
Masashi Kiyomi, Tomomi Matsui:
Integer Programming Based Algorithms for Peg Solitaire Problems. 229-240
Marcel Crâsmaru, John Tromp:
Ladders Are PSPACE-Complete. 241-249
Michael Buro:
Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs. 250-261

Further Experiments with Games

Ernst A. Heinz:
New Self-Play Results in Computer Chess. 262-276
Jeff Rollason:
SUPER-SOMA - Solving Tactical Exchanges in Shogi without Tree Searching. 277-296
Youhei Hori, Minenobu Seki, Reijer Grimbergen, Tsutomu Maruyama, Tsutomu Hoshino:
A Shogi Processor with a Field Programmable Gate Array. 297-314
Reijer Grimbergen:
Plausible Move Generation Using Move Merit Analysis with Cut-Off Thresholds in Shogi. 315-332
Jiefu Shi, Michael L. Littman:
Abstraction Methods for Game Theoretic Poker. 333-345
Takahisa Ando, Takao Uehara:
Reasoning by Agents in Computer Bridge Bidding. 346-364

Invited Talks and Reviews

Boris Stilman:
Linguistic Geometry for Solving War Games. 365-383
Kei-ichi Tainaka:
Physics and Ecology of Rock-Paper-Scissors Game. 384-395
Michael L. Littman:
Review: Computer Language Games. 396-404
Martin Müller:
Review: Computer Go 1984-2000. 405-413
Alexander Nareyek:
Review: Intelligent Agents for Computer Games. 414-422
Itsuki Noda, Ian Frank:
Review: RoboCup through 2000. 423-432
Takenobu Takizawa, Reijer Grimbergen:
Review: Computer Shogi through 2000. 433-442

Last update Tue May 22 23:23:33 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page