Hashi (Bridges) Puzzle Strategy: From Beginner to Expert

Few puzzles pack as much depth into as few rules as Hashi — the Japanese logic puzzle known in English as Bridges and in Chinese as 桥梁谜题. Its name is the Japanese word 橋 (hashi), meaning "bridge": your job is to connect a scattered archipelago of numbered islands with bridges. The rules fit in five sentences, yet a well-made 20×20 grid can occupy a sharp solver for twenty minutes or more. Hashi is also outstanding brain training, exercising exact counting, spatial reasoning, and connectivity thinking — the same mental muscles used in logistics, engineering, and programming. This guide moves from the rules through key patterns to advanced techniques, with a worked example you can replay on Puzzle PK.

What Is Hashi? The Japanese Bridge Puzzle

Origin. Hashi (橋, "bridge") is a Japanese logic puzzle created in the 1980s and popularized worldwide by Nikoli — the same publisher that introduced Sudoku to the West.
The premise. You are given a grid of numbered islands. Your task: draw bridges between them so every island gets exactly the number of bridges it demands, nothing crosses, and everything joins into one network.
Pure logic. No arithmetic beyond counting, no hidden tricks, no randomness — every bridge you draw should be justifiable by a rule.
Where to play. On Puzzle PK, play Hashi in Single mode on grids from 7×7 (a gentle warm-up) to 20×20 (serious endgame material), or jump into Speed PK to race other players in real time.

How to Play Hashi: Five Rules in Plain Words

Islands have numbers. Each island shows a number — the exact number of bridges that must touch it, no more, no fewer.
Bridges run horizontally or vertically, in straight lines between two islands.
At most two bridges between a pair. Single or double — never three.
Bridges never cross, and never pass through islands. A bridge connects exactly its two endpoints.
All islands must be connected. When finished, you can travel from any island to any other by hopping across bridges — one single network.

The puzzle is solved when every island has exactly its number of bridges, nothing crosses, and the whole grid is one connected network. That last rule is the one beginners forget, and it is often the key to the hardest deductions.

Start with Forced Moves: Corners and Edges

The golden rule of Hashi: never guess; hunt for moves that are forced. Before anything else, scan the grid for islands with limited options.

Corner islands have only two directions (right and down for a top-left corner, and so on). If only one direction contains another island, the corner must send every bridge it needs that way. A corner 1 with a single visible neighbor is fixed instantly — one bridge, draw it.
Edge islands have three directions, and the same logic applies: if two are empty, the remaining direction is forced.
Concrete case. In the worked example below, the bottom-left corner island (row 7, column 1) shows a 2 and has no island to its right, so both bridges must go straight up.

Corner and edge islands resolve quickly, and each resolved island narrows its neighbors' options — a chain reaction across the board.

The Heavy Hitters: 8-Islands and 6-Islands

Big numbers look intimidating but are often the easiest to place.

An 8-island is complete on sight. The number 8 is only possible when the island can see other islands in all four directions, and each direction contributes at most 2 bridges, so 4 × 2 = 8. An 8 forces two bridges in every direction — draw all four double bridges and mark it done.
A 6-island with three directions must be 2 + 2 + 2.
A 6-island with four directions splits as two double and two single bridges, and crucially every direction gets at least one bridge — none may stay empty.
General rule. If an island still needs k bridges with d open directions, at least k − d of those directions must receive double bridges. (If k > 2d, the puzzle is inconsistent — a handy sanity check.)

Core Deductions: Forced Pairs and "Must Connect"

The middle game turns on two ideas: forced pairs and dead directions.

Forced pairs. When an island has exactly one possible neighbor left, all its remaining bridges go there. In the worked example below, (4,7) shows a 2 and its only neighbor is (1,7) — a double bridge immediately.
The "at least one bridge" rule. Two islands that can see only each other must be joined by at least one bridge, or neither could ever be reached. More generally, if an island still needs bridges and has a single open direction, that direction must be used; when both islands in such a pair are 2s, the double bridge is forced.
Eliminating impossible bridges. Test before drawing: if even one bridge to a neighbor would push it over its number, the pair gets nothing; if one fits but two would overflow, the pair is capped at one.
Full islands close directions. The moment an island reaches its count, every direction away from it is dead — no more bridges may touch it.

"Must connect" and "cannot connect" are the two keys that separate solvers who glide through 12×12 and 15×15 grids from those who stall.

Advanced: Think About the Whole Network

Rule 5 is the deepest constraint, and the one most beginners ignore — because counting alone can produce "solutions" that never connect.

Take a 3×3 grid with a 2 in each of the four corners:

2 . 2
. . .
2 . 2

Double bridges along the top and bottom edges satisfy every number, but leave two separate pairs that never touch — not a finished puzzle. The real solution uses single bridges around the square, forming one loop. The numbers look equally happy either way; only the connectivity rule picks the winner.

Work from the borders inward. Corner and edge islands have the fewest options; resolve them first, and the interior usually simplifies afterwards.
The cut argument. Imagine a line that splits the islands into two groups. If no bridge crosses it, the groups can never become one network — so at least one bridge must cross any such cut. On large grids this forces specific bridges nothing else reveals.
The final check. Recount every island, confirm nothing crosses, then walk the network from any island. If you cannot reach all the others, something is wrong — usually a missing bridge, sometimes a wrong one.

A Complete Mini Solve: A 7×7 Worked Example

Put it all together on a real 7×7 puzzle (. is water, digits are islands):

43....3
.......
4..3...
......2
3......
...2...
2......

Using row,column coordinates (rows from the top), here is the entire solve — every step forced, no guessing:

(4,7) = 2 can see only (1,7). Forced pair → 2 bridges. (4,7) is done.
(1,7) = 3 has 2 bridges and needs 1 more; its only other neighbor is (1,2) → 1 bridge (1,7)–(1,2).
(1,2) = 3 has 1 bridge; its only open direction is left, to (1,1) → 2 bridges (1,2)–(1,1) (the two islands sit side by side in row 1).
(6,4) = 2 can see only (3,4). Forced pair → 2 bridges.
(3,4) = 3 has 2 bridges; its only other neighbor is (3,1) → 1 bridge (3,4)–(3,1).
(7,1) = 2 is a corner with nothing to its right, so its only direction is up → 2 bridges (7,1)–(5,1).
(5,1) = 3 has 2 bridges and needs 1 more; its only remaining neighbor is (3,1) → 1 bridge (5,1)–(3,1).
(3,1) = 4 has 2 bridges (from steps 5 and 7) and needs 2 more; its only open direction is up → 2 bridges (3,1)–(1,1).
(1,1) = 4 now has 2 from (1,2) plus 2 from (3,1) — exactly 4. Every island complete, nothing crosses, everything reachable. Solved.

Final bridge list: (1,1)–(1,2) ×2, (1,2)–(1,7) ×1, (1,7)–(4,7) ×2, (1,1)–(3,1) ×2, (3,1)–(3,4) ×1, (3,4)–(6,4) ×2, (3,1)–(5,1) ×1, (5,1)–(7,1) ×2.

Notice how step 3 unlocked step 8, and step 6 unlocked step 7: solving Hashi is a chain of forced moves, not a series of lucky guesses.

Common Mistakes and a Practice Plan

Common mistakes:

Guessing early. A guess usually contradicts ten minutes later, and erasing a half-solved grid is the fastest way to lose a Speed PK race.
Forgetting that 1 means exactly one bridge — a 1 with two possible neighbors still takes exactly one of them.
Ignoring the two-bridge cap and drawing three bridges between a pair.
Finishing with two or more separate clusters and calling it solved — always run the connectivity check.
Not tracking completed islands, so bridges get drawn onto islands that are already full.
Drawing a bridge through another island, or crossing an existing bridge.

A practice plan:

Start on 7×7 or 9×9 beginner grids. Solve slowly and name the rule behind every bridge.
After each solve, list which techniques you used; if you guessed even once, replay the puzzle and find the deduction you missed.
When comfortable, time yourself in Single mode, then step up: 12×12, then 15×15, then 20×20.
When stuck, don't guess — rescan for 8s and 6s, forced pairs, and border islands.
Graduate to Speed PK races: the timer forces you to spot forced moves faster, and that speed carries back into Single mode.

Why Play Hashi Online at Puzzle PK

Single mode offers grids from 7×7 to 20×20 with instant validation — counts and connectivity are confirmed as you go, with nothing to set up or clean up.
Speed PK mode is Hashi with a heartbeat: both players receive the identical puzzle, and the fastest correct solve wins. Every deduction becomes a reflex.
Stats and personal bests track your progress from your first 7×7 to your 20×20 records — improvement becomes measurable, not just felt.
Zero friction. No pencil, no eraser, no photocopied grid — just pure logic.

Start with a single 7×7 game and finish it without a single guess. The moment you can do that, you are ready to race. See you on the bridges!