Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Computers and Games: Second International Conference, CG 2001, Hamamatsu, Japan, October 26-28, 2000 Revised Papers > Review: Computer Language Games
Computers and Games: Second International Conference, CG 2001, Hamamatsu, Japan, October 26-28, 2000 Revised Papers |
Tony Marsland; Ian Frank
Springer Berlin Heidelberg
Computers and Games: Second International Conference, CG 2001, Hamamatsu, Japan, October 26-28, 2000 Revised Papers
Review: Computer Language Games
Authors

Michael L. Littman

ARI Id

1664820947493_3654792

Access

Not Available Free

Pages

396-404

DOI

10.1007/3-540-45579-5_26

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-45579-5_26

Table of Contents of Book
Showing 1 to 20 of 32 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
I-XIII
A Least-Certainty Heuristic for Selective Search
Paul E. Utgoff; Richard P. Cochran
1-18
Lambda-Search in Game Trees — with Application to Go
Thomas Thomsen
19-38
Abstract Proof Search
Tristan Cazenave
39-54
Solving Kriegspiel-Like Problems: Examining Efficient Search Methods
Makoto Sakuta; Hiroyuki Iida
55-73
Strategies for the Automatic Construction of Opening Books
Thomas R. Lincke
74-86
Awari Retrograde Analysis
Roel van der Goot
87-95
Construction of Chinese Chess Endgame Databases by Retrograde Analysis
Haw-ren Fang; Tsan-sheng Hsu; Shun-chin Hsu
96-114
Learning from Perfection
Jack van Rijswijck
115-132
Chess Neighborhoods, Function Combination, and Reinforcement Learning
Robert Levinson; Ryan Weber
133-150
Learning a Go Heuristic with Tilde
Jan Ramon; Tom Francis; Hendrik Blockeel
151-169
Learning Time Allocation Using Neural Networks
Levente Kocsis; Jos Uiterwijk; Jaap van den Herik
170-185
The Complexity of Graph Ramsey Games
Wolfgang Slany
186-203
Virus Versus Mankind
Aviezri S. Fraenkel
204-213
Creating Difficult Instances of the Post Correspondence Problem
Richard J. Lorentz
214-228
Integer Programming Based Algorithms for Peg Solitaire Problems
Masashi Kiyomi; Tomomi Matsui
229-240
Ladders Are PSPACE-Complete
Marcel Crâşmaru; John Tromp
241-249
Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs
Michael Buro
250-261
New Self-Play Results in Computer Chess
Ernst A. Heinz
262-276
SUPER-SOMA — Solving Tactical Exchanges in Shogi without Tree Searching
Jeff Rollason
277-296
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 32 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings