Abstract
We discuss some new geometric puzzles and the complexity of their
extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove
NP-completeness of solving them. Not only the solution of puzzles leads to interesting
questions, but also puzzle design gives rise to interesting theoretical questions.
This leads to the search for instances
... read more