Hashiwokakero is NP-complete

@article{Andersson2009HashiwokakeroIN,
  title={Hashiwokakero is NP-complete},
  author={Daniel Andersson},
  journal={Inf. Process. Lett.},
  year={2009},
  volume={109},
  pages={1145-1146}
}
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. 
BETA

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…