The following pages link to Hashiwokakero is NP-complete (Q990945):
Displaying 6 items.
- On a generalization of ``eight blocks to madness'' puzzle (Q906490) (← links)
- \textsc{Hanano} puzzle is \textsf{NP}-hard (Q1730016) (← links)
- A case study on the graph-transformational modeling and analysis of puzzles (Q2117266) (← links)
- Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems (Q2152094) (← links)
- Matchstick puzzles on a grid (Q2308506) (← links)
- Computational complexity of two pencil puzzles: Kurotto and Juosan (Q2695483) (← links)
