EVERY ISLAND BELONGS
Hashi.
A few islands. One connected network.
Find which bridges belong between them.
Puzzle 1 / 24
0 bridges
Tap two neighboring islands to cycle 0 → 1 → 2 → 0 bridges.
Choose two neighboring islands in the same row or column. Tap the pair again to cycle one bridge, two bridges, then none.
Join islands with one or two straight bridges. Each number counts the bridges touching that island. Bridges cannot cross or pass through another island. Connect every island into one network; loops are allowed.
Keyboard, touch & bridge counts
Tap an island, then its nearest neighbor in the same row or column. Repeat the pair to cycle no bridge → one → two → none. If a second bridge would exceed an island’s number, that change is rejected; use Remove connection to clear the selected pair instead. The selected pair and its current bridge count appear below the board. Numbers stay visible, double bridges use two separate lines, and an island receives a check mark when its number is satisfied.
Tab to the board; arrow keys move to a neighboring island. Enter or Space selects it. Escape cancels the selection or hint. Browser shortcuts, scrolling and pinch zoom remain available.
A single bridge can still become a double bridge. Check reviews whether your drawn bridges can be extended; it does not lock single bridges as final. Hint explains a forced total for one pair and waits for Apply hint. Undo applies to changes in this tab. After a reload, your saved draft is the new undo starting point.
24 original puzzles on 7×7 and 9×9 boards. Each is checked for one complete bridge network and a route using our supported deduction rules. Board size is not a measured difficulty rating. Your progress stays in this browser.
ALSO CALLED BRIDGES
How to play Hashi
Connect numbered islands with straight horizontal or vertical bridges. An island’s number tells you how many individual bridges must touch it.
- Use one bridge or two. A pair of neighboring islands can have at most two bridges between them. A double bridge counts twice toward both islands’ numbers.
- Keep the water clear. Bridges cannot cross, go diagonally or pass through another island. Connect only the nearest island in a straight direction.
- Join the whole network. Match every island’s number and connect all islands together. Separate finished groups do not count as a solution. Loops are allowed.
COUNT THE POSSIBLE CONNECTIONS
Think about capacity and connection
A bridge affects two numbers and can block a crossing route. Count what each island can still accept before adding another line.
- Start with limited neighbors. If an island has only one possible neighbor, that pair must carry all the bridges its number requires.
- Compare remaining capacity. Each neighboring pair carries at most two bridges. A 3 with only two possible neighbors must connect to both; one of those pairs must eventually be double.
- Keep a way out. A group needs a connection to the remaining islands. A single bridge can still become a double bridge; reaching every number only finishes the puzzle when the whole network is connected.
ONE NETWORK, STEP BY STEP
Before your next connection.
How do I add or remove bridges?
Tap one island, then its nearest neighbor in the same row or column. Repeating the pair cycles one bridge, two bridges and none when those counts are legal. Use Remove connection to clear the selected pair, including when its island cannot accept a second bridge. Undo reverses the last board change.
Are loops allowed?
Yes. This is the standard version with at most two bridges per pair, crossings forbidden and one connected network. A loop is allowed when all numbers and the other rules are satisfied.
Does Check treat a single bridge as finished?
No. A drawn single bridge means that pair has at least one bridge and may still receive a second. Check tests whether your current bridges can be extended. It keeps your board unchanged and reports an inconclusive result if the search reaches its limit.
How do explained hints work?
A hint shows a forced bridge count for one neighboring pair, with the supporting degree or connectivity reasoning. It waits for Apply hint. Internal deductions may also eliminate crossing routes; the game does not place a whole solution or silently remove your bridges.
Where do these puzzles come from?
They were generated for Brainfold and checked for unique answers, supported logical deductions and repeated layouts, including stretched versions of the same island structure. We do not copy another site’s boards or claim worldwide uniqueness. The rules are credited to Nikoli; Simon Tatham’s Bridges manual also describes the standard game.
Can I play with a keyboard or return later?
Arrow keys move between neighboring islands; Enter or Space selects an island, and Escape cancels a selection or hint. Your boards and completed records stay in this browser. Browsing does not overwrite them, and Undo history lasts for the current session. Progress does not sync between devices.