Free PDF downloads · No signup · Made for reMarkable, Supernote, BOOX, and standard printers.
Hashi (Bridges) Generator
Bridge the islands: single or double connections between neighbours, every count satisfied, one connected network — no crossings. Every board ships with its unique solution.
About Hashi (Bridges)
Hashiwokakero — build bridges between numbered islands until every count is satisfied and the whole archipelago forms one connected network. Bridges run straight between aligned neighbours, never cross, and never exceed two per connection. Boards ship only after a solver proves the numbers allow exactly one layout, and the answer page draws that layout.
Tips
- Islands with count equal to their number of open directions are forced.
- An island showing 3 with exactly three neighbours needs one bridge to each.
- Keep the network connected — isolated finished clusters mean a mistake somewhere.
FAQ
- When can I place a double bridge?
- Whenever two islands face only each other and both still need two or more connections — the pair must then be doubled.
- Do bridges pass through islands?
- No. A bridge always connects the nearest visible island in its direction; anything between blocks the line.
Make the worksheet useful
Choose, check, then download
Puzzle solvers who enjoy network-building and connectivity logic.
Suggested workflow
- 1Choose a board size and generate.
- 2Check each island's count against its open directions.
- 3Download the board plus the drawn bridge network.
Why this format
A solver proves the island counts admit exactly one bridge layout before anything prints.
Sample PDF
A 10×10 board lands around a dozen islands — a solid ten-minute solve.