25,161
edits
Changes
Created page with "'''Home * Conferences * Computer and Games 2002''' '''< Prev Next >''' The '''Third International Conference on Computers and Games..."
'''[[Main Page|Home]] * [[Conferences]] * Computer and Games 2002'''
'''[[CG 2000|< Prev]] [[CG 2004|Next >]]'''
The '''Third International Conference on Computers and Games''' was held in [https://en.wikipedia.org/wiki/Edmonton Edmonton], [https://en.wikipedia.org/wiki/Canada Canada], July 25-27, [[Timeline#2002|2002]].
=Proceedings=
* [[Jonathan Schaeffer]], [[Martin Müller]], [[Yngvi Björnsson]] (eds.)
: [https://link.springer.com/book/10.1007%2Fb94154 Computers and Games] <ref>[http://ilk.uvt.nl/icga/organisation/books/CG2002.php Computers and Games], [http://ilk.uvt.nl/icga/organisation/books/ Books at sale at ICGA]</ref>
: Third International Conference, CG 2002
: [https://en.wikipedia.org/wiki/Edmonton Edmonton], [https://en.wikipedia.org/wiki/Canada Canada], July 25 - 27, 2002
: [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Volume 2883, 2003
: [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer] Berlin / Heidelberg
: ISBN 978-3-540-20545-6
=Lectures=
<ref>[https://link.springer.com/book/10.1007%2Fb94154 Computers and Games], [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]</ref>
==Evaluation and Learning==
* [[David Wolfe]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_1 Distinguishing Gamblers from Investors at the Blackjack Table]''. [[CG 2002]]
* [[Konstantinos Tournavitis]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_2 MOUSE(μ): A Self-teaching Algorithm that Achieved Master-Strength at Othello]''. [[CG 2002]]
* [[Graham Kendall]], [[Stephen Shaw]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_3 Investigation of an Adaptive Cribbage Player]''. [[CG 2002]]
* [[Ari Shapiro]], [[Gil Fuchs]], [[Robert Levinson]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_4 Learning a Game Strategy Using Pattern-Weights and Self-play]''. [[CG 2002]]
==Search==
* [[Mark Winands]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_5 PDS-PN: A New Proof-Number Search Algorithm: Application to Lines of Action]''. [[CG 2002]]
* [[Tristan Cazenave]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_6 A Generalized Threats Search Algorithm]''. [[CG 2002]]
* [[Martin Müller]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_7 Proof-Set Search]''. [[CG 2002]]
* [[Nathan Sturtevant]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_8 A Comparison of Algorithms for Multi-player Games]''. [[CG 2002]]
* [[Henry Avetisyan]], [[Richard J. Lorentz]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_9 Selective Search in an Amazons Program]''. [[CG 2002]]
* [[Ingo Althöfer]], [[Raymond Georg Snatzke]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_10 Playing Games with Multiple Choice Systems]''. [[CG 2002]]
* [[Levente Kocsis]], [[Jos Uiterwijk]], [[Eric Postma]], [[Jaap van den Herik]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_11 The Neural MoveMap Heuristic in Chess]''. [[CG 2002]]
* [[Reijer Grimbergen]], [[Jeff Rollason]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_12 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'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_13 Solitaire Clobber]''. [[CG 2002]]
* [[Aviezri Fraenkel]], [[Ofer Rahat]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_14 Complexity of Error-Correcting Codes Derived from Combinatorial Games]''. [[CG 2002]]
* [[Teigo Nakamura]], [[Elwyn Berlekamp]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_15 Analysis of Composite Corridors]''. [[CG 2002]]
==Opening/Endgame Databases==
* [[Jing Yang]], [[Simon Liao]], [[Mirek Pawlak]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_16 New Winning and Losing Positions for 7×7 Hex]''. [[CG 2002]]
* [[Thomas Lincke]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_17 Position-Value Representation in Opening Books]''. [[CG 2002]]
* [[Haw-ren Fang]], [[Tsan-sheng Hsu]], [[Shun-Chin Hsu]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_18 Indefinite Sequence of Moves in Chinese Chess Endgames]''. [[CG 2002]]
==Commercial Games==
* [[Michael Buro]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_19 ORTS: A Hack-Free RTS Game Environment]''. [[CG 2002]]
* [[Craig A. Lindley]], [[Mirjam Eladhari]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_20 Causal Normalization: A Methodology for Coherent Story Logic Design in Computer Role-Playing Games]''. [[CG 2002]]
* [[Clark Verbrugge]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_21 A Structure for Modern Computer Narratives]''. [[CG 2002]]
==Single-Agent Search/Planning==
* [[Ling Zhao]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_22 Tackling Post’s Correspondence Problem]''. [[CG 2002]]
* [[Carlos Linares López]], [[Andreas Junghanns]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_23 Perimeter Search Performance]''. [[CG 2002]]
* [[Adi Botea]], [[Martin Müller]], [[Jonathan Schaeffer]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_24 Using Abstraction for Planning in Sokoban]''. [[CG 2002]]
==Computer Go==
* [[Bruno Bouzy]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_25 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'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_26 Local Move Prediction in Go]''. [[CG 2002]]
* [[Bill Spight]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_27 Evaluating Kos in a Neutral Threat Environment: Preliminary Results]''. [[CG 2002]]
=External Links=
* [http://www.informatik.uni-trier.de/~ley/db/conf/cg/cg2002.html 3. CG 2002: Edmonton, Canada] from [http://www.informatik.uni-trier.de/%7Eley/db/index.html The DBLP Computer Science Bibliography]
* [http://homepages.gac.edu/~wolfe/games/clobber/competition.html CG'02 Special Announcements], [[Elwyn Berlekamp|Elwyn Berlekamp's]] [[Clobber]] problem composition contest
=References=
<references />
'''[[Conferences|Up one Level]]'''
'''[[CG 2000|< Prev]] [[CG 2004|Next >]]'''
The '''Third International Conference on Computers and Games''' was held in [https://en.wikipedia.org/wiki/Edmonton Edmonton], [https://en.wikipedia.org/wiki/Canada Canada], July 25-27, [[Timeline#2002|2002]].
=Proceedings=
* [[Jonathan Schaeffer]], [[Martin Müller]], [[Yngvi Björnsson]] (eds.)
: [https://link.springer.com/book/10.1007%2Fb94154 Computers and Games] <ref>[http://ilk.uvt.nl/icga/organisation/books/CG2002.php Computers and Games], [http://ilk.uvt.nl/icga/organisation/books/ Books at sale at ICGA]</ref>
: Third International Conference, CG 2002
: [https://en.wikipedia.org/wiki/Edmonton Edmonton], [https://en.wikipedia.org/wiki/Canada Canada], July 25 - 27, 2002
: [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Volume 2883, 2003
: [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer] Berlin / Heidelberg
: ISBN 978-3-540-20545-6
=Lectures=
<ref>[https://link.springer.com/book/10.1007%2Fb94154 Computers and Games], [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]</ref>
==Evaluation and Learning==
* [[David Wolfe]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_1 Distinguishing Gamblers from Investors at the Blackjack Table]''. [[CG 2002]]
* [[Konstantinos Tournavitis]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_2 MOUSE(μ): A Self-teaching Algorithm that Achieved Master-Strength at Othello]''. [[CG 2002]]
* [[Graham Kendall]], [[Stephen Shaw]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_3 Investigation of an Adaptive Cribbage Player]''. [[CG 2002]]
* [[Ari Shapiro]], [[Gil Fuchs]], [[Robert Levinson]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_4 Learning a Game Strategy Using Pattern-Weights and Self-play]''. [[CG 2002]]
==Search==
* [[Mark Winands]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_5 PDS-PN: A New Proof-Number Search Algorithm: Application to Lines of Action]''. [[CG 2002]]
* [[Tristan Cazenave]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_6 A Generalized Threats Search Algorithm]''. [[CG 2002]]
* [[Martin Müller]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_7 Proof-Set Search]''. [[CG 2002]]
* [[Nathan Sturtevant]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_8 A Comparison of Algorithms for Multi-player Games]''. [[CG 2002]]
* [[Henry Avetisyan]], [[Richard J. Lorentz]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_9 Selective Search in an Amazons Program]''. [[CG 2002]]
* [[Ingo Althöfer]], [[Raymond Georg Snatzke]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_10 Playing Games with Multiple Choice Systems]''. [[CG 2002]]
* [[Levente Kocsis]], [[Jos Uiterwijk]], [[Eric Postma]], [[Jaap van den Herik]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_11 The Neural MoveMap Heuristic in Chess]''. [[CG 2002]]
* [[Reijer Grimbergen]], [[Jeff Rollason]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_12 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'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_13 Solitaire Clobber]''. [[CG 2002]]
* [[Aviezri Fraenkel]], [[Ofer Rahat]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_14 Complexity of Error-Correcting Codes Derived from Combinatorial Games]''. [[CG 2002]]
* [[Teigo Nakamura]], [[Elwyn Berlekamp]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_15 Analysis of Composite Corridors]''. [[CG 2002]]
==Opening/Endgame Databases==
* [[Jing Yang]], [[Simon Liao]], [[Mirek Pawlak]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_16 New Winning and Losing Positions for 7×7 Hex]''. [[CG 2002]]
* [[Thomas Lincke]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_17 Position-Value Representation in Opening Books]''. [[CG 2002]]
* [[Haw-ren Fang]], [[Tsan-sheng Hsu]], [[Shun-Chin Hsu]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_18 Indefinite Sequence of Moves in Chinese Chess Endgames]''. [[CG 2002]]
==Commercial Games==
* [[Michael Buro]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_19 ORTS: A Hack-Free RTS Game Environment]''. [[CG 2002]]
* [[Craig A. Lindley]], [[Mirjam Eladhari]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_20 Causal Normalization: A Methodology for Coherent Story Logic Design in Computer Role-Playing Games]''. [[CG 2002]]
* [[Clark Verbrugge]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_21 A Structure for Modern Computer Narratives]''. [[CG 2002]]
==Single-Agent Search/Planning==
* [[Ling Zhao]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_22 Tackling Post’s Correspondence Problem]''. [[CG 2002]]
* [[Carlos Linares López]], [[Andreas Junghanns]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_23 Perimeter Search Performance]''. [[CG 2002]]
* [[Adi Botea]], [[Martin Müller]], [[Jonathan Schaeffer]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_24 Using Abstraction for Planning in Sokoban]''. [[CG 2002]]
==Computer Go==
* [[Bruno Bouzy]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_25 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'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_26 Local Move Prediction in Go]''. [[CG 2002]]
* [[Bill Spight]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_27 Evaluating Kos in a Neutral Threat Environment: Preliminary Results]''. [[CG 2002]]
=External Links=
* [http://www.informatik.uni-trier.de/~ley/db/conf/cg/cg2002.html 3. CG 2002: Edmonton, Canada] from [http://www.informatik.uni-trier.de/%7Eley/db/index.html The DBLP Computer Science Bibliography]
* [http://homepages.gac.edu/~wolfe/games/clobber/competition.html CG'02 Special Announcements], [[Elwyn Berlekamp|Elwyn Berlekamp's]] [[Clobber]] problem composition contest
=References=
<references />
'''[[Conferences|Up one Level]]'''
