Cover Image
Read Now

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

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

Full description

Bibliographic Details
Other Authors: Schaeffer, Jonathan (Editor), Müller, Martin (Editor), Björnsson, Yngvi (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2003, 2003
Edition:1st ed. 2003
Series:Lecture Notes in Computer Science
Subjects:
Mathematical Statistics
Artificial Intelligence / Data Processing
Computer Science
Computer Science / Mathematics
Numerical Analysis
Discrete Mathematics In Computer Science
Probability And Statistics In Computer Science
Algorithms
Discrete Mathematics
Data Science
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 04642nmm a2200421 u 4500
001 EB000655587
003 EBX01000000000000001349164
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783540400318 
100 1 |a Schaeffer, Jonathan  |e [editor] 
245 0 0 |a Computers and Games  |h Elektronische Ressource  |b Third International Conference, CG 2002, Edmonton, Canada, July 25-27, 2002, Revised Papers  |c edited by Jonathan Schaeffer, Martin Müller, Yngvi Björnsson 
250 |a 1st ed. 2003 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2003, 2003 
300 |a XII, 436 p  |b online resource 
505 0 |a 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 
653 |a Mathematical statistics 
653 |a Artificial intelligence / Data processing 
653 |a Computer science 
653 |a Computer science / Mathematics 
653 |a Numerical Analysis 
653 |a Discrete Mathematics in Computer Science 
653 |a Probability and Statistics in Computer Science 
653 |a Computer Science 
653 |a Algorithms 
653 |a Numerical analysis 
653 |a Discrete mathematics 
653 |a Data Science 
700 1 |a Müller, Martin  |e [editor] 
700 1 |a Björnsson, Yngvi  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
028 5 0 |a 10.1007/b94154 
856 4 0 |u https://doi.org/10.1007/b94154?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 4 
520 |a 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 event in this biennial series. The conference was held at the University of Alberta(Edmonton,Alberta,Canada),July25–27,2002.Theprogramconsisted of the main conference featuring refereed papers and keynote speakers, as well as several side events including the Games Informatics Workshop, the Agents in Computer Games Workshop, the Trading Agents Competition, and the North American Computer Go Championship. CG 2002 attracted 110 participants from over a dozen countries. Part of the successoftheconferencewasthatitwasco-locatedwiththeNationalConference of the American Association for Arti?cial Intelligence (AAAI), which began in Edmonton just as CG 2002 ended. The CG 2002 program had 27 refereed paper presentations. The papers ranged over a wide variety of AI-related topics including search, knowledge, learning, planning, and combinatorial game theory. Research test-beds included one-player games (blackjack, sliding-tile puzzles, Sokoban), two-player games (Amazons, awari, chess, Chinese chess, clobber, Go, Hex, Lines of Action, O- ello, shogi), multi-player games (Chinese checkers, cribbage, Diplomacy, hearts, spades), commercial games (role-playing games, real-time strategy games), and novel applications (Post’s Correspondence Problem) 

Similar Items