Computers and Games Third International Conference, CG 2002, Edmonton, Canada, July 25-27, 2002, Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Schaeffer, Jonathan (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Müller, Martin (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Björnsson, Yngvi (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Έκδοση: 1st ed. 2003.
• Σειρά: Lecture Notes in Computer Science, 2883
• Θέματα: Computer science.; Computer science-Mathematics.; Data structures (Computer science).; Algorithms.; Numerical analysis.; Mathematical statistics.; Popular Computer Science.; Discrete Mathematics in Computer Science.; Data Structures.; Algorithm Analysis and Problem Complexity.; Numeric Computing.; Probability and Statistics in Computer Science.

The Computers and Games (CG) series began in 1998 with the objective of showcasing new developments in arti?cial intelligence (AI) research that used games as the experimental test-bed. The ?rst two CG conferences were held at Hamamatsu,Japan(1998,2000).ComputersandGames2002(CG2002)wasthe third even...

Πίνακας περιεχομένων:

• 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.