Home * Conferences * Computer and Games 2000
< Prev Next >

The Second International Conference on Computers and Games was held in Hamamatsu, Japan, October 26-28, 2000.

Proceedings

		Tony Marsland and Ian Frank (eds.) Computers and Games [1] Second International Conference, CG 2000 Hamamatsu, Japan, October 26 - 28, 2000 Lecture Notes in Computer Science, Volume 2063, 2001 Springer ISBN 3-540-43080-6

Lectures

Search and Strategies

• Paul E. Utgoff, Richard P. Cochran (2000). A Least-Certainty Heuristic for Selective Search. CG 2000 » LCF
• Thomas Thomsen (2000). Lambda-Search in Game Trees - with Application to Go. CG 2000 also published in ICGA Journal, Vol. 23, No. 4, winning the 2001 ICGA Journal Award, preprint as pdf » Lambda-Search
• Tristan Cazenave (2000). Abstract Proof Search. CG 2000, pdf
• Makoto Sakuta, Hiroyuki Iida (2000). Solving Kriegspiel-Like Problems: Examining Efficient Search Methods. CG 2000
• Thomas Lincke (2000). Strategies for the Automatic Construction of Opening Books. CG 2000 » Opening Book
• Roel van der Goot (2000). Awari Retrograde Analysis.
• Haw-ren Fang, Tsan-sheng Hsu, Shun-chin Hsu (2000). Construction of Chinese Chess Endgame Databases by Retrograde Analysis. CG 2000

Learning and Pattern Acquisition

• Jack van Rijswijck (2000). Learning from Perfection: A Data Mining Approach to Evaluation Function Learning in Awari. CG 2000, pdf
• Robert Levinson, Ryan Weber (2000). Chess Neighborhoods, Function Combination, and Reinforcement Learning. CG 2000, pdf
• Jan Ramon, Tom Francis, Hendrik Blockeel (2000). Learning a Go Heuristic with Tilde. CG 2000
• Levente Kocsis, Jos Uiterwijk, Jaap van den Herik (2000). Learning Time Allocation using Neural Networks. CG 2000, postscript

Theory and Complexity Issues

• Wolfgang Slany (2000). The Complexity of Graph Ramsey Games. CG 2000
• Aviezri Fraenkel (2000). Virus Versus Mankind. CG 2000
• Richard J. Lorentz (2000). Creating Difficult Instances of the Post Correspondence Problem. CG 2000
• Masashi Kiyomi, Tomomi Matsui (2000). Integer Programming Based Algorithms for Peg Solitaire Problems. CG 2000
• Marcel Crâşmaru, John Tromp (2000). Ladders Are PSPACE-Complete. CG 2000
• Michael Buro (2000). Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs. CG 2000, pdf

Further Experiments with Games

• Ernst A. Heinz (2000). New Self-Play Results in Computer Chess. CG 2000
• Jeff Rollason (2000). SUPER-SOMA - Solving Tactical Exchanges in Shogi without Tree Searching. CG 2000, Word preprint
• Youhei Hori, Minenobu Seki, Tsutomu Maruyama, Reijer Grimbergen, Tsutomu Hoshino (2000). A Shogi Processor with a Field Programmable Gate Array. CG 2000
• Reijer Grimbergen (2000). Plausible Move Generation Using Move Merit Analysis with Cut-Off Thresholds in Shogi. CG 2000
• Jiefu Shi, Michael L. Littman (2000). Abstraction Methods for Game Theoretic Poker. CG 2000
• Takahisa Ando, Takao Uehara (2000). Reasoning by Agents in Computer Bridge Bidding. CG 2000

Invited Talks and Reviews

• Boris Stilman (2000). Linguistic Geometry for Solving War Games. CG 2000
• Kei-ichi Tainaka (2000). Physics and Ecology of Rock-Paper-Scissors Game. CG 2000
• Michael L. Littman (2000). Review: Computer Language Games. CG 2000
• Martin Müller (2000). Review: Computer Go 1984–2000. CG 2000
• Alexander Nareyek (2000). Review: Intelligent Agents for Computer Games. CG 2000
• Itsuki Noda, Ian Frank (2000). Review: RoboCup through 2000. CG 2000
• Takenobu Takizawa, Reijer Grimbergen (2000). Review: Computer Shogi through 2000. CG 2000

Reports & Reviews

• Jack van Rijswijck, Martin Müller (2001). The Second International Conference on Computers and Games. ICCA Journal, Vol. 24, No. 1
• Dap Hartmann (2002). Computers and Games. ICGA Journal, Vol. 25, No. 2 (Review)

External Links

• 2. CG 2000: Hamamatsu, Japan from The DBLP Computer Science Bibliography

References

1. ^ Computers and Games Books at sale at ICGA

What links here?

Up one Level