🌉 How to Solve Hashi: Rules, Counting Tricks and What Our Levels Mean
Hashi, also published as Hashiwokakero, Bridges and Chopsticks, is a Japanese logic puzzle about joining islands. Every island carries a number, and that number is exactly how many bridges touch it. Nearly every deduction in Hashi is a small sum about one island and its neighbors, which is why a 5×5 makes a good first logic puzzle and an 11×11 with twenty-odd islands is still a proper workout.
📋 The Rules of Hashi
- Bridges run in straight lines, across or down, never diagonally.
- A bridge joins an island to the nearest island in that direction. It can't jump over one.
- Two islands can share one bridge or two, never three.
- Bridges can't cross each other.
- Each island's number is the total number of bridges touching it.
- When you finish, every island is part of one network: you can walk from any island to any other.
🔀 How Hashi Differs from Loop Puzzles
If you come to Hashi from Slitherlink or Masyu, drop one habit: Hashi doesn't ask for a single path or a single loop. The network can branch (the 6 in the picture above sends bridges in all four directions), and it can contain closed loops (the square formed by that 6, the two 4s below it and the 3). The only shape rule is that everything ends up in one piece.
There's nothing like Sudoku's rows, either. An island can see at most four other islands, the nearest one in each direction, so you never scan a whole line. You look at one island, count what its neighbors could give it, and move on.
🔢 Technique 1: Full Islands
Count how many bridges each island could possibly hold: two per neighbor. When the number equals that maximum, there's no choice left, and every neighbor gets a double.
- A 4 with two neighbors is 2 + 2.
- A 6 with three neighbors is 2 + 2 + 2.
- An 8 always has four neighbors and takes a double to each.
- A 2 with one neighbor is a double to that neighbor.
"Corner" and "edge" here mean "has two neighbors" and "has three", not the literal edge of the grid. An island in the middle of the board whose other directions run off into empty water counts as a corner.
➕ Technique 2: One Short of Full
If the number is one less than the maximum, you don't know where the gap is, but you do know every neighbor gets at least one bridge: a 3 with two neighbors, a 5 with three, a 7 with four. Build those singles now and come back for the rest.
Both techniques are cases of one rule: take the island's number, subtract the most the other neighbors could take, and whatever is left must go to this one. Say a 4 has three neighbors and one of them is a 1. The 1 can take a single bridge at most, so the other two neighbors must supply at least three between them. Neither can take more than two, so each gets at least one.
✖️ Technique 3: Bridges Block Bridges
Every bridge you build cuts every link that would cross it. In the picture, the vertical bridge between the 2 and the 3 means the 2 on the left can no longer reach the 4 on the right. Its only other neighbor is the 3 below it, so both of its bridges go there. The 4 loses the same link and is left with two neighbors, so it becomes a full island: a double up and a double down.
🏝️ Technique 4: Don't Seal Off a Group
Because everything has to end up in one network, you can't build a bridge that closes a group off from the rest. The two cases you'll meet: two 1s that face each other can never be linked, because they'd form a finished pair stranded on its own. Two 2s can share a single bridge but never a double, for the same reason. The rule scales up, too: any bridge that would complete a group whose islands are all full, while other islands are still waiting, is wrong.
On this page you'll seldom need it to make progress. In 1,200 of our puzzles, Techniques 1–3 alone finished all but 24. Those 24 needed this rule as well, and they come from the bigger boards: 7 of 100 on 11×11 Hard, and none at all on 5×5. It still earns its place, because it stops the early mistake (a quick 1–1 link) that only shows up at the very end.
⚠️ Common Mistakes
- Linking 1 to 1. It looks like a perfect match and it's always wrong, unless those two islands are the whole puzzle.
- Trying to jump an island. A bridge stops at the first island in its path, so the island beyond isn't a neighbor.
- Counting a green island as open. It's full. Leave it out of your sums.
- Thinking loops are illegal. They're fine. Only crossings and separate groups break the rules.
- Matching the numbers and stopping. If every island is green but the status bar says the islands aren't all connected, you've built two networks. Look for a double inside one group that could become two singles, one of them reaching the other group.
📐 Sizes and Levels on This Page
Here's what the generator actually produces. We built 100 puzzles at every size and level, 1,200 in all, and counted them. Each cell shows the average number of islands, with the smallest and largest board in brackets.
| Size | Easy 😊 | Medium 🤔 | Hard 🧠 |
|---|---|---|---|
| 5×5 | 4.0 (4–4) | 4.3 (4–6) | 5.5 (5–7) |
| 7×7 | 5.5 (5–8) | 7.7 (7–11) | 9.9 (9–13) |
| 9×9 | 9.9 (9–13) | 13.3 (12–17) | 17.4 (16–22) |
| 11×11 | 15.3 (14–20) | 20.9 (19–27) | 25.5 (24–32) |
Two things are worth knowing. First, our levels change how many islands you get, not which techniques you need. At every size, Easy and Hard fall to the same counting rules; Hard simply gives you more islands to apply them to, and slightly more often needs the isolation rule. Second, every board stays close to its level's island count. A board that couldn't place enough islands is thrown away and built again rather than shown to you sparse.
Expect doubles, too. Between 56% and 67% of the linked island pairs on our boards carry two bridges, depending on size and level. And 2s, 3s and 4s make up three quarters of all island numbers. So a double is never a surprise here. Still, prove each one before you build it.
✅ Does Every Hashi Puzzle Here Have Exactly One Answer?
Yes. Before a board is shown, a solver that knows only the four techniques above has to finish it. Those techniques never guess, so a board they can finish has exactly one answer, and you can finish it the same way. Boards the solver can't finish are thrown away and built again. That happens to about 1 board in 10 on the biggest Hard boards, and never on 5×5. We double-checked 1,200 boards with a separate exhaustive solver, which tries every possible arrangement of bridges, and every one had exactly one solution.
Because there is only one answer, Hint can always be trusted. If you've built a bridge that isn't in the answer, the hint takes it back first, and only then adds a missing one.
🖱️ How to Play on This Page
- Click or tap an island, then a neighbor in the same row or column, to build one bridge.
- Do it again on the same pair for a double. A third time removes them.
- Islands turn green when they're full and red when they have too many.
- The game won't let you build a bridge across another one.
- Undo steps back one move, Hint takes back one wrong bridge if you have one, and otherwise places one bridge from the answer. Solution shows the whole thing.
- New Puzzle builds a fresh board at the size and level you've chosen.
📜 Where Hashi Comes From
Hashiwokakero is published by Nikoli, the Japanese puzzle publisher that also gave Sudoku its name. An early form appeared in Puzzle Communication Nikoli issue 28 in December 1989, and the puzzle as it's played now in issue 31, September 1990. The name means "build bridges." English editions call it Bridges or Chopsticks, and the second name comes from a mistranslation: hashi written 橋 means bridge, while hashi written 箸 means chopsticks. The Times printed it as Hashi, and in France, Denmark, the Netherlands and Belgium it appears as Ai-Ki-Ai.
Mathematicians have shown that deciding whether an arbitrary Hashi grid has a solution is NP-complete (Andersson, 2009), which is a formal way of saying that very large hand-made grids can get very hard. Ours stop at 11×11.
🧒 A Good First Logic Puzzle
The 5×5 boards here have 4 to 6 islands, and 299 of the 300 we tested could be solved with Techniques 1–3 alone. That makes them a gentle way to teach the idea behind every logic puzzle, that a number can force a move, using nothing harder than small sums. Green and red islands give instant feedback, so a young player can check their own counting without anyone reading the rules aloud.
🚀 Ready?
Pick 7×7 Easy, find the island with the fewest options, and build the bridges it can't avoid. Then count again. If you enjoy the counting, Minesweeper runs on the same idea of a number counting what touches it, and Norinori is a gentle next step into shading puzzles.