H. Jaap van den Herik / Yngvi Björnsson / Nathan S. Netanyahu (eds.)

Computers and Games

4th International Conference, CG 2004, Ramat-Gan, Israel, July 5-7, 2004. Revised Papers
Herausgegeben:Herik, H. Jaap van den; Björnsson, Yngvi; Netanyahu, Nathan S.

• Broschiertes Buch

Produktbeschreibung

Efficient Control of Selective Simulations.- Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games.- Rediscovering *-Minimax Search.- *-Minimax Performance in Backgammon.- Associating Shallow and Selective Global Tree Search with Monte Carlo for 9 × 9 Go.- Learning to Estimate Potential Territory in the Game of Go.- An Improved Safety Solver for Computer Go.- Searching for Compound Goals Using Relevancy Zones in the Game of Go.- Rule-Tolerant Verification Algorithms for Completeness of Chinese-Chess Endgame Databases.- An External-Memory Retrograde Analysis Algorithm.- Generating an Opening Book for Amazons.- Building a World-Champion Arimaa Program.- Blockage Detection in Pawn Endings.- Dao: A Benchmark Game.- Incremental Transpositions.- Kayles on the Way to the Stars.- Searching over Metapositions in Kriegspiel.- The Relative History Heuristic.- Locally Informed Global Search for Sums of Combinatorial Games.- Current Challenges in Multi-player Game Search.- Preventing Look-Ahead Cheating with Active Objects.- Strategic Interactions in the TAC 2003 Supply Chain Tournament.

Produktdetails

• Theoretical Computer Science and General Issues 3846
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 11674399, 978-3-540-32488-1
• Seitenzahl: 352
• Erscheinungstermin: 10. Februar 2006
• Englisch
• Abmessung: 235mm x 155mm x 20mm
• Gewicht: 534g
• ISBN-13: 9783540324881
• ISBN-10: 3540324887
• Artikelnr.: 20972356

Autorenporträt

H. Jaap van den Herik, Universiteit Maastricht, The Netherlands / Yngvi Björnsson, Reykjavik University, Iceland / Nathan S. Netanyahu, Bar-Ilan University, Ramat-Gan, Israel

Inhaltsangabe

Efficient Control of Selective Simulations.- Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games.- Rediscovering *-Minimax Search.- *-Minimax Performance in Backgammon.- Associating Shallow and Selective Global Tree Search with Monte Carlo for 9 × 9 Go.- Learning to Estimate Potential Territory in the Game of Go.- An Improved Safety Solver for Computer Go.- Searching for Compound Goals Using Relevancy Zones in the Game of Go.- Rule-Tolerant Verification Algorithms for Completeness of Chinese-Chess Endgame Databases.- An External-Memory Retrograde Analysis Algorithm.- Generating an Opening Book for Amazons.- Building a World-Champion Arimaa Program.- Blockage Detection in Pawn Endings.- Dao: A Benchmark Game.- Incremental Transpositions.- Kayles on the Way to the Stars.- Searching over Metapositions in Kriegspiel.- The Relative History Heuristic.- Locally Informed Global Search for Sums of Combinatorial Games.- Current Challenges in Multi-player Game Search.- Preventing Look-Ahead Cheating with Active Objects.- Strategic Interactions in the TAC 2003 Supply Chain Tournament.