CG 2002

Home * Conferences * Computer and Games 2002

< Prev Next >

The Third International Conference on Computers and Games was held in Edmonton, Canada, July 25-27, 2002.

Proceedings

• Jonathan Schaeffer, Martin Müller, Yngvi Björnsson (eds.)

Computers and Games ¹

Third International Conference, CG 2002

Edmonton, Canada, July 25 - 27, 2002

Lecture Notes in Computer Science, Volume 2883, 2003

Springer Berlin / Heidelberg

ISBN 978-3-540-20545-6

Lectures

²

Evaluation and Learning

• David Wolfe (2002). Distinguishing Gamblers from Investors at the Blackjack Table. CG 2002
• Konstantinos Tournavitis (2002). MOUSE(μ): A Self-teaching Algorithm that Achieved Master-Strength at Othello. CG 2002
• Graham Kendall, Stephen Shaw (2002). Investigation of an Adaptive Cribbage Player. CG 2002
• Ari Shapiro, Gil Fuchs, Robert Levinson (2002). Learning a Game Strategy Using Pattern-Weights and Self-play. CG 2002

Search

• Mark Winands, Jos Uiterwijk, Jaap van den Herik (2002). PDS-PN: A New Proof-Number Search Algorithm: Application to Lines of Action. CG 2002
• Tristan Cazenave (2002). A Generalized Threats Search Algorithm. CG 2002
• Martin Müller (2002). Proof-Set Search. CG 2002
• Nathan Sturtevant (2002). A Comparison of Algorithms for Multi-player Games. CG 2002
• Henry Avetisyan, Richard J. Lorentz (2002). Selective Search in an Amazons Program. CG 2002
• Ingo Althöfer, Raymond Georg Snatzke (2002). Playing Games with Multiple Choice Systems. CG 2002
• Levente Kocsis, Jos Uiterwijk, Eric Postma, Jaap van den Herik (2002). The Neural MoveMap Heuristic in Chess. CG 2002
• Reijer Grimbergen, Jeff Rollason (2002). Board Maps and Hill-Climbing for Opening and Middle Game Play in Shogi. CG 2002

Combinatorial Games/Theory

• Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer (2002). Solitaire Clobber. CG 2002
• Aviezri Fraenkel, Ofer Rahat (2002). Complexity of Error-Correcting Codes Derived from Combinatorial Games. CG 2002
• Teigo Nakamura, Elwyn Berlekamp (2002). Analysis of Composite Corridors. CG 2002

Opening/Endgame Databases

• Jing Yang, Simon Liao, Mirek Pawlak (2002). New Winning and Losing Positions for 7×7 Hex. CG 2002
• Thomas Lincke (2002). Position-Value Representation in Opening Books. CG 2002
• Haw-ren Fang, Tsan-sheng Hsu, Shun-Chin Hsu (2002). Indefinite Sequence of Moves in Chinese Chess Endgames. CG 2002

Commercial Games

• Michael Buro (2002). ORTS: A Hack-Free RTS Game Environment. CG 2002
• Craig A. Lindley, Mirjam Eladhari (2002). Causal Normalization: A Methodology for Coherent Story Logic Design in Computer Role-Playing Games. CG 2002
• Clark Verbrugge (2002). A Structure for Modern Computer Narratives. CG 2002

Single-Agent Search/Planning

• Ling Zhao (2002). Tackling Post’s Correspondence Problem. CG 2002
• Carlos Linares López, Andreas Junghanns (2002). Perimeter Search Performance. CG 2002
• Adi Botea, Martin Müller, Jonathan Schaeffer (2002). Using Abstraction for Planning in Sokoban. CG 2002

Computer Go

• Bruno Bouzy (2002). A Small Go Board Study of Metric and Dimensional Evaluation Functions. CG 2002
• Erik van der Werf, Jos Uiterwijk, Eric Postma, Jaap van den Herik (2002). Local Move Prediction in Go. CG 2002
• Bill Spight (2002). Evaluating Kos in a Neutral Threat Environment: Preliminary Results. CG 2002

External Links

• 3. CG 2002: Edmonton, Canada from The DBLP Computer Science Bibliography
• CG'02 Special Announcements, Elwyn Berlekamp's Clobber problem composition contest

References