Connect the islands
Bridges, also known as Hashi or Hashiwokakero, is a network puzzle. Each numbered circle is an island. Its number tells you the total number of bridges that must meet it.
- Connect islands in the same row or column. Bridges are always horizontal or vertical.
- A connection can contain one bridge or two. Three bridges between a pair are not allowed.
- A bridge can only reach the nearest visible island in that direction. It cannot pass through another island.
- Bridges cannot cross, and every island must belong to one connected network.
Count what is possible
One neighbour gives you the answer
If an island has only one visible neighbour, a clue of 1 requires a single bridge to it; a clue of 2 requires a double bridge.
Use maximum capacity
An island with two possible neighbours can have at most 4 bridges. If its clue is 4, both connections must be double. If its clue is 3, it needs at least one bridge to each neighbour.
Keep the whole network in mind
Matching the numbers is only part of the task. Separate groups are not a solution. For example, connecting two 1 islands to one another would seal them off. That is impossible when other islands still need to join the network.
Controls
Select an island, then select a visible neighbour in the same row or column. Repeat the pair to cycle from one bridge to two, then none. Select the same island again to cancel your selection. On a keyboard, Tab enters or leaves the board, arrow keys move between islands, and Enter or Space selects one.
Checks and hints
An island turns green when its current bridge count matches its number. Green does not guarantee its connections are the right ones. Check compares existing connections with the unique solution. Hint reveals the correct count for one connection, and is counted in your finish message. The completed board is also checked for connectivity and crossings.