Hashiwokakero is NP-complete

  • Authors:

  • Daniel Andersson

  • Affiliations:

  • Department of Computer Science, Aarhus University, Denmark

  • Venue:
  • Information Processing Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.89

Visualization

Abstract

In a Hashiwokakero puzzle, one must build bridges to connect a set of islands. We show that deciding the solvability of such puzzles is NP-complete.