Skip to main content
Article thumbnail
Location of Repository

Wooden Geometric Puzzles: Design and Hardness Proofs

By H. Alt, H.L. Bodlaender, M.J. van Kreveld, G. Rote and G. Tel


We discuss some new geometric puzzles and the complexity of their\ud extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove\ud NP-completeness of solving them. Not only the solution of puzzles leads to interesting\ud questions, but also puzzle design gives rise to interesting theoretical questions.\ud This leads to the search for instances of partition that use only integers and are\ud uniquely solvable.We show that instances of polynomial size exist with this property.\ud This result also holds for partition into k subsets with the same sum: We construct\ud instances of n integers with subset sum O(nk+1), for fixed k

Topics: Wiskunde en Informatica, Geometric puzzles, Complexity, Partition
Year: 2008
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.