The Complexity of Some Combinatorial Puzzles
arXiv:1507.08690
Abstract
We show that the decision versions of the puzzles Knossos and The Hour-Glass are complete for NP.
arXiv:1507.08690
We show that the decision versions of the puzzles Knossos and The Hour-Glass are complete for NP.