The (n2-1)-puzzle and related relocation problems
Journal of Symbolic Computation
Journal of the ACM (JACM)
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of checkers on an N × N board
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
POGGI: Puzzle-Based Online Games on Grid Infrastructures
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Player-customized puzzle instance generation for Massively Multiplayer Online Games
Proceedings of the 8th Annual Workshop on Network and Systems Support for Games
Theoretical Computer Science
UNO is hard, even for a single player
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
The complexity of node blocking for dags
Journal of Combinatorial Theory Series A
Zen Puzzle Garden is NP-complete
Information Processing Letters
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Playing savitch and cooking games
Concurrency, Compositionality, and Correctness
Solving tantrix via integer programming
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Unordered constraint satisfaction games
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
The time complexity of A* with approximate heuristics on multiple-solution search spaces
Journal of Artificial Intelligence Research
UNO is hard, even for a single player
Theoretical Computer Science
Discrete Applied Mathematics
| Hi-index | 0.00 |
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 encourage further research. In particular, we begin with general background in combinatorial game theory, which analyzes ideal play in perfect-information games. Then we survey results about the complexity of determining ideal play in these games, and the related problems of solving puzzles, in terms of both polynomial-time algorithms and computational intractability results. Our review of background and survey of algorithmic results are by no means complete, but should serve as a useful primer.