The Complexity of Some Combinatorial Puzzles

We show that the decision versions of the puzzles Knossos and The Hour-Glass are complete for NP