Computers and Games: 4th International Conference, CG 2004, Ramat-Gan, Israel, July 5-7, 2004. Revised Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the thoroughly refereed post-proceedings of the 4th International Conference on Computers and Games, CG 2004, held in Ramat-Gan, Israel, in July 2004, and co-located with the 12th World Computer Chess Championship and the 9th Computer Olympiad.

The 21 revised full papers presented together with one keynote article were carefully selected during two rounds of reviewing and improvement from 37 submissions. The papers cover all aspects of artificial intelligence in computer-game playing. Topics addressed are evaluation and learning, search, combinatorial games and theory opening and endgame databases, single-agent search and planning, and computer Go.

Author(s): Brian Sheppard (auth.), H. Jaap van den Herik, Yngvi Björnsson, Nathan S. Netanyahu (eds.)
Series: Lecture Notes in Computer Science 3846 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2006

Language: English
Pages: 334
Tags: Discrete Mathematics in Computer Science; Numeric Computing; Probability and Statistics in Computer Science; Artificial Intelligence (incl. Robotics); Algorithm Analysis and Problem Complexity; Data Structures

Front Matter....Pages -
Efficient Control of Selective Simulations....Pages 1-20
Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games....Pages 21-34
Rediscovering *-M inimax Search....Pages 35-50
*-M inimax Performance in Backgammon....Pages 51-66
Associating Shallow and Selective Global Tree Search with Monte Carlo for 9 × 9 Go....Pages 67-80
Learning to Estimate Potential Territory in the Game of Go....Pages 81-96
An Improved Safety Solver for Computer Go....Pages 97-112
Searching for Compound Goals Using Relevancy Zones in the Game of Go....Pages 113-128
Rule-Tolerant Verification Algorithms for Completeness of Chinese-Chess Endgame Databases....Pages 129-144
An External-Memory Retrograde Analysis Algorithm....Pages 145-160
Generating an Opening Book for Amazons....Pages 161-174
Building a World-Champion Arimaa Program....Pages 175-186
Blockage Detection in Pawn Endings....Pages 187-201
Dao: A Benchmark Game....Pages 202-219
Incremental Transpositions....Pages 220-231
Kayles on the Way to the Stars....Pages 232-245
Searching over Metapositions in Kriegspiel....Pages 246-261
The Relative History Heuristic....Pages 262-272
Locally Informed Global Search for Sums of Combinatorial Games....Pages 273-284
Current Challenges in Multi-player Game Search....Pages 285-300
Preventing Look-Ahead Cheating with Active Objects....Pages 301-315
Strategic Interactions in the TAC 2003 Supply Chain Tournament....Pages 316-331
Back Matter....Pages -