Skip to content

Guides › Bridges

How to solve Hashi (Bridges) puzzles

Hashiwokakero, usually shortened to Hashi, is a puzzle of numbered islands on a grid. You join them with straight bridges, horizontal or vertical, at most two between the same pair, never crossing, until every island has exactly its number of bridges and all islands form one connected group. Bridges is DailyLogic’s daily Hashi; this guide lists the deductions that solve it.

1. Islands that are forced at once

Count an island’s neighbours: the islands it can reach in a straight line with nothing in between. Each neighbour can take at most two bridges.

  • A 1 with one neighbour: that single bridge.
  • An 8: two bridges in all four directions. A 6 with three neighbours and a 4 with two neighbours work the same way.
  • A 2 in a corner with two neighbours: one bridge each, unless a neighbour is a 1 (then the other direction takes both).
  • Any island whose number equals twice its neighbour count: two bridges to every neighbour.

2. At least one bridge each

If an island needs more bridges than its neighbours can supply minus two, every neighbour gets at least one. A 3 with two neighbours must send at least one bridge each way; a 5 with three neighbours, likewise; a 7 sends at least one bridge in all four directions. Draw those single bridges first and come back for the second one later.

3. Two 1s and two 2s never pair alone

  • Two 1s facing each other cannot be joined: that bridge would isolate both from the rest of the puzzle.
  • Two 2s facing each other cannot take a double bridge for the same reason, unless they are the only two islands on the board.

These rules remove options, and removing an option from an island with few neighbours often forces what remains.

4. Bridges block crossings

Once a bridge is drawn, no other bridge can pass through it. A long horizontal bridge cuts the column it crosses in two, so islands on opposite sides are no longer neighbours. Recount their neighbours after every bridge; a 3 that just lost a neighbour may now be forced.

5. Count what is left

Keep a running tally: the bridges an island still needs versus the free capacity of its remaining neighbours. When they are equal, every free slot is used. When a neighbour is already full, mark that direction as closed.

6. The connectivity trap

The finished puzzle is one connected network. If a group of islands would all be complete while still cut off from the rest, the last bridge that closed the group is wrong. In the endgame this rule decides between two otherwise equal choices: take the bridge that keeps the network open.

7. Finish the doubles

The last moves are usually upgrading single bridges to doubles. An island one short with one open direction takes its second bridge there. Every Bridges board is published only after a solver counts exactly one solution, so these last steps are forced.

Sizes

The daily ladder uses 6×6 to 10×10 grids with 6 to 24 islands; unlimited mode has 6×6, 8×8 and 10×10.

Loop shares the “one connected structure, no crossings” idea. Tents and Mines use the same neighbour counting, and Trail is the path puzzle where everything must also link up.

Play today's puzzle: Bridges