Computers and Games: 5th International Conference, CG 2006, Turin, Italy, May 29-31, 2006, Revised Papers by H. Jaap van den HerikComputers and Games: 5th International Conference, CG 2006, Turin, Italy, May 29-31, 2006, Revised Papers by H. Jaap van den Herik

Computers and Games: 5th International Conference, CG 2006, Turin, Italy, May 29-31, 2006, Revised…

byH. Jaap van den HerikEditorPaolo Ciancarini, H. (Jeroen) H.L. Donkers

Hardcover | October 1, 2007

Pricing and Purchase Info

$92.54 online 
$96.95 list price
Earn 463 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the thoroughly refereed post-proceedings of the 5th International Conference on Computers and Games, CG 2006, co-located with the 14th World Computer-Chess Championship and the 11th Computer Olympiad. The 24 revised 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.

Title:Computers and Games: 5th International Conference, CG 2006, Turin, Italy, May 29-31, 2006, Revised…Format:HardcoverDimensions:283 pagesPublished:October 1, 2007Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540755373

ISBN - 13:9783540755371

Reviews

Table of Contents

Computer Analysis of Chess Champions.- Automated Chess Tutor.- A New Heuristic Search Algorithm for Capturing Problems in Go.- An Open Boundary Safety-of-Territory Solver for the Game of Go.- Monte-Carlo Proof-Number Search for Computer Go.- Virtual Global Search: Application to 9×9 Go.- Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search.- Combinatorics of Go.- Abstracting Knowledge from Annotated Chinese-Chess Game Records.- Automatic Strategy Verification for Hex.- Feature Construction for Reinforcement Learning in Hearts.- A Skat Player Based on Monte-Carlo Simulation.- A Retrograde Approximation Algorithm for One-Player Can't Stop.- Improving Depth-First PN-Search: 1?+?? Trick.- Search Versus Knowledge Revisited Again.- Counting the Number of Three-Player Partizan Cold Games.- LUMINES Strategies.- Computing Proper Equilibria of Zero-Sum Games.- Comparative Study of Approximate Strategies for Playing Sum Games Based on Subgame Types.- On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game.- Cheat-Proof Serverless Network Games.- Monte-Carlo Methods in Pool Strategy Game Trees.- Optimization of a Billiard Player - Tactical Play.- Gender and Cultural Differences (If Any!): South African School Children and Computer Games.