Skip to main content
SpringerLink
Log in

Computers and Games

Second International Conference, CG 2001, Hamamatsu, Japan, October 26-28, 2000 Revised Papers

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Tony Marsland

    1. Department of Computer Science, University of Alberta, Edmonton, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ian Frank

    1. Future University - Hakodate, Hakodate, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2063)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (30 papers)

  1. Front Matter

    Pages I-XIII
    Download chapter PDF

  2. Search and Strategies

    1. A Least-Certainty Heuristic for Selective Search

      • Paul E. Utgoff, Richard P. Cochran
      Pages 1-18

    2. Lambda-Search in Game Trees — with Application to Go

      • Thomas Thomsen
      Pages 19-38

    3. Abstract Proof Search

      • Tristan Cazenave
      Pages 39-54

    4. Solving Kriegspiel-Like Problems: Examining Efficient Search Methods

      • Makoto Sakuta, Hiroyuki Iida
      Pages 55-73

    5. Strategies for the Automatic Construction of Opening Books

      • Thomas R. Lincke
      Pages 74-86

    6. Awari Retrograde Analysis

      • Roel van der Goot
      Pages 87-95

    7. Construction of Chinese Chess Endgame Databases by Retrograde Analysis

      • Haw-ren Fang, Tsan-sheng Hsu, Shun-chin Hsu
      Pages 96-114

  3. Learning and Pattern Acquisition

    1. Learning from Perfection

      • Jack van Rijswijck
      Pages 115-132

    2. Chess Neighborhoods, Function Combination, and Reinforcement Learning

      • Robert Levinson, Ryan Weber
      Pages 133-150

    3. Learning a Go Heuristic with Tilde

      • Jan Ramon, Tom Francis, Hendrik Blockeel
      Pages 151-169

    4. Learning Time Allocation Using Neural Networks

      • Levente Kocsis, Jos Uiterwijk, Jaap van den Herik
      Pages 170-185

  4. Theory and Complexity Issues

    1. The Complexity of Graph Ramsey Games

      • Wolfgang Slany
      Pages 186-203

    2. Virus Versus Mankind

      • Aviezri S. Fraenkel
      Pages 204-213

    3. Creating Difficult Instances of the Post Correspondence Problem

      • Richard J. Lorentz
      Pages 214-228

    4. Integer Programming Based Algorithms for Peg Solitaire Problems

      • Masashi Kiyomi, Tomomi Matsui
      Pages 229-240

    5. Ladders Are PSPACE-Complete

      • Marcel Crâşmaru, John Tromp
      Pages 241-249

    6. Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs

      • Michael Buro
      Pages 250-261

  5. Further Experiments with Games

    1. New Self-Play Results in Computer Chess

      • Ernst A. Heinz
      Pages 262-276

    2. SUPER-SOMA — Solving Tactical Exchanges in Shogi without Tree Searching

      • Jeff Rollason
      Pages 277-296
Back to top

Keywords

Editors and Affiliations

  • Department of Computer Science, University of Alberta, Edmonton, Canada

    Tony Marsland

  • Future University - Hakodate, Hakodate, Japan

    Ian Frank

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation