Bridges · Solving guide

Hashi beginner strategies: finding forced bridges

Every Hashi island has a bridge budget: its number is the total it must receive. Compare that number with what its available neighbours can supply, then check that your decisions keep a single network possible.

Count visible neighbours

From an island, look up, down, left and right. Only the next island in a direction can be a neighbour. You cannot jump over an island, draw a diagonal bridge or cross an existing bridge.

Each neighbour can usually supply at most two bridges. An island with two available neighbours therefore has a maximum capacity of four. Neighbours with little remaining capacity can reduce that maximum further.

Use islands that need their full capacity

A 4 with exactly two available neighbours must take two bridges from each. If either connection supplied only one, the total could reach at most three. A 6 with three available neighbours and an 8 with four work the same way.

Before applying the rule, check that those connections really are available and that the neighbours can accept the bridges. Count the remaining capacity if you have already drawn some.

The central 4 needs both double bridges when these are its only available neighbours. This is a local teaching position.

Find the forced single bridges too

A 3 with only two available neighbours needs at least one bridge to each. If you omitted one neighbour, the other could provide at most two, which is not enough.

Likewise, a 5 with three available neighbours must touch all three, and a 7 with four must touch all four. You have proved a minimum of one on each connection; you have not yet proved which ones will become doubles.

Keep the whole network connected

Matching every number is not enough. All islands must belong to one network. Two islands labelled 1 cannot connect only to each other if other islands remain, because both would be finished and their little component could never join the rest.

In the example, four 2s could form two separate double-bridge pairs. Every number would look satisfied, but the network would be split. A single bridge along each side of the square keeps all four islands connected. Unlike Slant, Hashi allows a loop.

Left: two isolated pairs fail the network rule. Right: four single bridges connect every island and satisfy every 2.

Recount after every useful connection

A completed island cannot take more bridges. A new bridge can also block a crossing connection elsewhere. Both changes can reduce another island’s options, creating a move that was not forced before.

Scan for full-capacity islands, then forced singles, then groups that risk becoming cut off. When considering a tempting extra bridge, ask whether the islands it finishes could still connect to the rest of the puzzle.

  • Two parallel lines count as two bridges, not one connection for the clue total.
  • A bridge must stop at the next island in its direction.
  • Use the Library for practice; its results do not add league points.

Put it into practice

Try an Easy Bridges Library puzzle and look for one deduction from this guide.

Play Bridges

Sign in or create an account to save your progress.

More to explore

Four Colour · Solving guide

Four Colour: start where three colours already meet

On a Four Colour board, a region that touches three different fixed colours has only one colour left. Colour it and the next region often corners itself the same way. An original five by five board where one such region settles four of the five open regions, checked by trying every possible colouring.

Read the guide →

Colour Fields · Solving guide

Colour Fields: a full field fences itself in

In Colour Fields, the moment a field reaches its number every square touching it has to take the other colour. An original five by five board where a 1, a 2, two 4s and a 7 each close in turn, checked by trying every possible colouring.

Read the guide →

Pairs · Solving guide

Pairs: a placed domino crosses out its copies

When a Pairs board stops giving you forced cells, look at the dominoes already placed. Each pair appears once, so every other place its digits touch is dead, and that can leave a cell with one partner. A worked example, checked against the game's solver.

Read the guide →

HubbardGames guide

Per-game standings: where you rank in one game

Tap a game's icon on the Board and you get a table for that game alone: today's field with results and hints, and an all-time table ranked on average points per day finished. Where it lives, what each column means, what it leaves out, and four invented Bridges days where the fastest player comes third.

Read the guide →