Hashi, in full Hashiwokakero (橋をかけろ, "build bridges"), and published in English as Bridges, is a Japanese logic puzzle. It was first printed by Nikoli in Puzzle Communication Nikoli in 1990. You will also see it written Hashi wo Kakero, and misspelled Hasiwokakero.
You can play it in your browser right now, with nothing to install.
The rules
A board is a grid with numbered circles on it. Each circle is an island, and its number says exactly how many bridge ends must touch it.
- Bridges run straight, horizontally or vertically between two islands. Never diagonally, never bending.
- At most two bridges join the same pair of islands. A double bridge counts as two towards both of its islands.
- Bridges may not cross each other, and may not pass through an island.
- Every island's number must be met exactly. Not at least, not at most.
- The finished board must be one single network. From any island you can walk the bridges to every other island. Two correct-looking halves that do not touch is not a solution.
That last rule is the one newcomers miss, and it is also the one that makes the puzzle interesting: it turns a counting exercise into a connectivity problem.
You never have to guess
A properly made Hashi has exactly one solution, and that solution is reachable by reasoning alone. If you are stuck, there is a deduction you have not spotted, not a coin to flip. Everything below is a way of spotting one.
These are the same five reasons our game gives when you ask it for a hint: it will not just place a bridge, it names the rule that forced it.
1. Counting: what the number leaves over
Count an island's neighbours and the most bridges they could take. If the island's number needs all of it, every one of those bridges is certain.
The classic cases:
- An island marked 4 in a corner has only two directions. Two directions hold at most four bridges, so both pairs are doubles. Certain, immediately.
- An island marked 6 on an edge has three directions, holding at most six. All three are doubles.
- An island marked 8 anywhere has four directions and needs all eight. Four doubles.
- An island marked 3 with two directions must put at least one bridge in each: three cannot fit in one pair.
The general form: if number is greater than maximum possible − 2, then every direction carries at least one bridge.
2. Crossing: what another bridge forbids
A placed bridge blocks the lane it occupies. Any bridge that would have to cross it is impossible, so the islands that were counting on that direction must find their bridges elsewhere.
This is why the order you solve in matters: each bridge you place narrows somebody else's options, and the board gets easier as it fills.
3. The cut: a bridge that has to exist
Look for an island, or a small group, whose only remaining way to reach the rest of the board is through one particular lane. Because the finished board must be a single network, that bridge must exist. Nothing else can connect them.
This technique finds bridges that pure counting never will, and it is usually what breaks a board that feels stuck.
4. The seal: a bridge that would strand a group
The mirror image of the cut. Sometimes placing a bridge, or a second bridge on an existing pair, would finish off a small group of islands, satisfying all their numbers while leaving them sealed away from the rest of the board.
That cannot be the answer, so that bridge is forbidden. Ruling it out often forces the real one into view.
5. The probe: follow it to a dead end
The last resort, and still not guessing. Assume a particular number of bridges in one lane, follow the consequences, and if they lead to a contradiction, an island that can no longer reach its number or a group cut off for good, then that assumption was wrong and the alternative is proven.
This is ordinary proof by contradiction. You are not trying something to see what happens; you are establishing a fact.
A way to work
- Sweep the board for the forced numbers first: corners of 4, edges of 6, any 8. They cost nothing to find.
- Mark the directions you have ruled out. Knowing where a bridge cannot go is worth as much as knowing where one must.
- When counting dries up, switch to connectivity: look for the cut and the seal.
- Re-sweep after every few bridges. Each one you place changes what the counting rule says about its neighbours.
- Keep the single-network rule in view the whole way. A board that satisfies every number but falls into two islands of islands is not finished.
Common mistakes
- Treating the number as a minimum. It is exact.
- Forgetting that a double bridge counts twice at both ends.
- Finishing every number and ignoring that the board is in two pieces.
- Guessing early on a hard board instead of looking for the cut.
Play it
Our Hashi has four sizes. 7×7 and 9×9 have a hundred levels each to learn on, then 12×12 and 15×15 that never run out, generated fresh on your device. Every board has one solution and is checked to be solvable by reasoning alone. The hint names the rule it used, and the check marks what is wrong rather than only telling you that something is.
Get it on Google Play ▶ Play in your browser
← Anubis Productions