Professional Documents
Culture Documents
Information Processing Letters: Daniel Andersson
Information Processing Letters: Daniel Andersson
Hashiwokakero is NP-complete
Daniel Andersson
Department of Computer Science, Aarhus University, Denmark
a r t i c l e i n f o a b s t r a c t
Article history: In a Hashiwokakero puzzle, one must build bridges to connect a set of islands. We show
Received 7 May 2009 that deciding the solvability of such puzzles is NP-complete.
Accepted 28 July 2009 © 2009 Elsevier B.V. All rights reserved.
Available online 6 August 2009
Communicated by B. Doerr
Keywords:
Computational complexity
Combinatorial problems
1. Introduction
2. Reduction
0020-0190/$ – see front matter © 2009 Elsevier B.V. All rights reserved.
doi:10.1016/j.ipl.2009.07.017
1146 D. Andersson / Information Processing Letters 109 (2009) 1145–1146