Computers and Games

Third International Conference, CG 2002, Edmonton, Canada, July 25-27, 2002, Revised Papers

Häftad, Engelska, 2003

Av Jonathan Schaeffer, Martin Müller, Yngvi Björnsson

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the thoroughly refereed post-proceedings of the Third International Conference on Computers and Games, CG 2002, held in Edmonton, Alberta, Canada in July 2002.The 27 revised full papers presented were carefully selected during two rounds of reviewing and improvement. The papers are organized in topical sections on evaluation and learning, search, combinatorial games and theory opening and endgame databases, single-agent search and planning, and computer Go.

Produktinformation

Utgivningsdatum2003-11-12
Mått155 x 235 x 25 mm
Vikt674 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor436
Upplaga2003
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540205456

Tillhör följande kategorier

Diskret matematik inom Naturvetenskap och teknik
Beräkning och matematisk analys inom Naturvetenskap och teknik
Matematisk statistik inom Naturvetenskap och teknik
Programmeringsböcker inom Data och it
Databaser inom Data och it
Systemvetenskap och AI inom Data och it
Datorspel / onlinespel inom Data och it

1: Evaluation and Learning.- Distinguishing Gamblers from Investors at the Blackjack Table.- MOUSE(?): A Self-teaching Algorithm that Achieved Master-Strength at Othello.- Investigation of an Adaptive Cribbage Player.- Learning a Game Strategy Using Pattern-Weights and Self-play.- 2: Search.- PDS-PN: A New Proof-Number Search Algorithm.- A Generalized Threats Search Algorithm.- Proof-Set Search.- A Comparison of Algorithms for Multi-player Games.- Selective Search in an Amazons Program.- Playing Games with Multiple Choice Systems.- The Neural MoveMap Heuristic in Chess.- Board Maps and Hill-Climbing for Opening and Middle Game Play in Shogi.- 3: Combinatorial Games/Theory.- Solitaire Clobber.- Complexity of Error-Correcting Codes Derived from Combinatorial Games.- Analysis of Composite Corridors.- 4: Opening/Endgame Databases.- New Winning and Losing Positions for 7×7 Hex.- Position-Value Representation in Opening Books.- Indefinite Sequence of Moves in Chinese Chess Endgames.- 5: Commercial Games.- ORTS: A Hack-Free RTS Game Environment.- Causal Normalization: A Methodology for Coherent Story Logic Design in Computer Role-Playing Games.- A Structure for Modern Computer Narratives.- 6: Single-Agent Search/Planning.- Tackling Post’s Correspondence Problem.- Perimeter Search Performance.- Using Abstraction for Planning in Sokoban.- 7: Computer Go.- A Small Go Board Study of Metric and Dimensional Evaluation Functions.- Local Move Prediction in Go.- Evaluating Kos in a Neutral Threat Environment: Preliminary Results.