Wooden geometric puzzles: design and hardness proofs

  • Authors:

  • Helmut Alt;Hans Bodlaender;Marc Van Kreveld;Günter Rote;Gerard Tel

  • Affiliations:

  • Department of Computer Science, Freie Universität Berlin;Department of Information and Computing Sciences, Utrecht University;Department of Information and Computing Sciences, Utrecht University;Department of Computer Science, Freie Universität Berlin;Department of Information and Computing Sciences, Utrecht University

  • Venue:
  • FUN'07 Proceedings of the 4th international conference on Fun with algorithms
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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 of partition that use only integers and are uniquely solvable. We show that instances of polynomial size exist with this property. This result also holds for partition into k subsets with the same sum: We construct instances of n integers with subset sum O(nk+1), for fixed k.