One jump ahead: challenging human supremacy in checkers
One jump ahead: challenging human supremacy in checkers
Rush Hour is PSAPCE-complete, or "Why you should generously tip parking lot attendants"
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The np-completeness of the hamiltonian cycle problem in planar diagraphs with degree bound two
Information Processing Letters
Finding optimal solutions to Rubik's cube using pattern databases
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Computational Complexity of NURIKABE
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
| Hi-index | 0.00 |
Amazons is a young board game with simple rules and a high branching factor, which makes it a suitable test-bed for planning research. This paper considers the computational complexity of Amazons puzzles and restricted Amazons endgames. We first prove the NP-completeness of the Hamilton circuit problem for cubic subgraphs of the integer grid. This result is then used to showthat solving Amazons puzzles is an NP-complete task and determining the winner of simple Amazons endgames is NP-equivalent.