Erik D. Demaine  Home/Search
Context Related
| mit.edu/~edemaine/papers/...paper.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/~edemaine/papers/AlgGa... (more) Homepages: E.Demaine |
Rate this article:      (best)Comment on this article |
Abstract: Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to... (Update)
Cited by: More
Combinatorial Games: Selected Bibliography with a Succinct.. - Fraenkel (2006) (Correct)
Angel, Devil, and King - Kutz, Pór (Correct)
Tetris is Hard, Even to Approximate - Demaine, Hohenberger, Liben-Nowell (2003) (Correct)
Active bibliography (related documents): More All
1.1: Phutball Endgames are Hard - Demaine, Demaine, Eppstein (2002) (Correct)
0.6: Finding Optimal Solutions to Atomix - Hüffner (2002) (Correct)
0.6: Pearl Puzzles are NP-complete - Friedman (Correct)
Similar documents based on text: More All
0.2: Appendix B - Open Problems At (Correct)
0.2: Folding and Cutting Paper - Demaine, Demaine, Lubiw (1998) (Correct)
0.2: Adaptive Protocols for Negotiating Non-Deterministic Choice over.. - Demaine (1997) (Correct)
Related documents from co-citation: More All
5: Minesweeper is NP-complete (context) - Kaye - 2000
4: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Michael, David et al. - 1979
4: Can You Win at Tetris (context) - Brzustowski - 1992
BibTeX entry: (Update)
E. Demaine. Playing games with algorithms: Algorithmic combinatorial game theory. Computing Research Repository, 2001. Preprint cs.CC/0106019, http://www.arXiv.org/abs/cs.CC/0106019. http://citeseer.ist.psu.edu/demaine01playing.html More
@inproceedings{ demaine01playing,
author = "Erik D. Demaine",
title = "Playing Games with Algorithms: Algorithmic Combinatorial Game Theory",
series = "Lecture Notes in Computer Science",
volume = "2136",
pages = "18+",
year = "2001",
url = "citeseer.ist.psu.edu/demaine01playing.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
103 On Numbers and Games (context) - Conway - 1976
85 Combinatorial auctions: A survey - de Vries, Vohra - 2001
69 and the Internet (context) - Papadimitriou, games - 2001
40 Winning Ways (context) - Berlekamp, Conway et al. - 1982
37 Motion planning in the presence of movable obstacles (context) - Wilfong - 1991
24 Sokoban is PSPACE-complete - Culberson - 1998
21 Mathematical Go: Chilling Gets the Last Point (context) - Berlekamp, Wolfe - 1994
15 GO is polynomial-space hard (context) - Lichtenstein, Sipser - 1980
15 Cellular Automata and Complexity: Collected Papers (context) - Wolfram - 1994
15 Minesweeper is NP-complete (context) - Kaye - 2000
12 a game with a complete mathematical theory (context) - Bouton
11 Mathematics and games (context) - Grundy - 1939
11 Unsolved problems in combinatorial games - Guy - 1996
10 Motion planning amidst movable square blocks is PSPACE compl.. (context) - Bremner, O'Rourke et al. - 1994
9 PushPush and Push-1 are NPhard in 2D - Demaine, Demaine et al. - 2000
9 Motion planning amidst movable square blocks (context) - Dhagat, O'Rourke - 1992
8 The complexity of Go (context) - Robson - 1983
8 puzzle and related relocation problems (context) - Ratner, Warmuth - 1990
7 values of various games (context) - Guy, Smith - 1956
7 Checkers is EXPTIME complete (context) - Robson, by - 1984
6 Uber mathematische Kampfspiele (context) - Sprague
5 Pushing blocks is NP-complete for noncrossing solution paths - Demaine, Ho - 2001
4 The Dots and Boxes Game: Sophisticated Child's Play (context) - Berlekamp - 2000
4 is NP-hard (context) - Ho, Push- - 2000
3 The complexity of Clickomania - Biedl, Demaine et al. - 2001
3 Coin-moving puzzles (context) - Demaine, Demaine et al. - 2000
3 The angel problem (context) - Conway - 1996
3 Sliding Piece Puzzles (context) - Hordern - 1986
3 board - preliminary report (context) - Fraenkel, Garey et al. - 1978
2 Combinatorial games: Selected bibliography with a succinct g.. - Fraenkel - 1994
2 Computing a perfect strategy for n n chess requires time e.. (context) - Fraenkel, Lichtenstein - 1981
2 Rush Hour is PSPACE-complete (context) - Flake, Baum - 2001
2 Graphs and composite games (context) - Smith - 1966
2 Simple Amazons endgames and their connection to Hamilton cir.. - Buro - 2000
1 New Toads and Frogs results - Erickson - 1996
1 Hex ist PSPACE-vollstandig (context) - Reisch - 1981
1 Phutball endgames are NPhard (context) - Demaine, Demaine et al. - 2001
1 Who wins domineering on rectangular boards (context) - Lachmann, Moore et al. - 2000
1 Go endgames are PSPACE-hard (context) - Wolfe - 2001
http://www.ics
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC