Computers and Games

5th International Conference, CG 2006, Turin, Italy, May 29-31, 2006, Revised Papers
Artikelnummer: 978-3-540-75537-1
Einband: Kartonierter Einband (Kt)
Verfügbarkeit: Lieferbar in ca. 20-45 Arbeitstagen
CHF 70.00
decrease increase

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.

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.

Schreiben Sie Ihre eigene Bewertung
  • Nur registrierte Benutzer können Produkte bewerten
*
*
Schlecht
Sehr gut
*
*
*
*
VerlagSpringer EN
EinbandKartonierter Einband (Kt)
Erscheinungsjahr2007
Seitenangabe283 S.
AusgabekennzeichenEnglisch
AbbildungenXII, 283 p.
MasseH23.5 cm x B15.5 cm 468 g
CoverlagSpringer (Imprint/Brand)
ReiheLecture Notes in Computer Science; Theoretical Computer Science and General Issues
AutorHerik, H. Jaap van den (Hrsg.) / Ciancarini, Paolo (Hrsg.) / Donkers, H. (Jeroen) H.L. (Hrsg.)

Alle Bände der Reihe "Lecture Notes in Computer Science; Theoretical Computer Science and General Issues"

Weitere Titel von H. Jaap van den (Hrsg.) Herik

Produktbewertungen
Nur registrierte Benutzer können Produkte bewerten