Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs

@inproceedings{Buro2000SimpleAE,
  title={Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs},
  author={Michael Buro},
  booktitle={Computers and Games},
  year={2000}
}
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 rst prove the NP{ completeness of the Hamilton circuit problem for cubic subgraphs of the integer grid. This result is then used to show that solving amazons puzzles is a NP-complete task and determining the winner of simple amazons endgames is NP-equivalent. 
Highly Cited
This paper has 21 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…