What an island needs, and where it can go
Each number says how many bridges touch that island. Bridges run straight to the nearest island in a row or column, a pair can share one or two, bridges never cross, and every island must end up in one network.
Count the room. A neighbour can take at most two bridges, and a neighbour marked 1 can take only one. When an island needs nearly all the room it has, some bridges are forced: a 3 with two neighbours, one of them a 1, needs two bridges to the other.
Then keep one network. Two 1s joined to each other are finished, with no bridge left to reach anyone else. So a 1 never bridges to another 1, unless they are the only two islands.
1Count the bridges each neighbour can still take.
2Place the bridges an island cannot do without.
3Never close off a group, such as two 1s joined together.
A 3 beside a 1
C5, bottom right, needs 3. Its neighbours are A5 above it and C3 to its left.
A5 is a 1, so it can take only one bridge. That leaves at least two of C5's three for C3, and two is the most a pair can share. So C5 has two bridges to C3 and one to A5.
Now A5 is complete, and so is C5.
A 1 in the corner
A1, top left, needs one bridge. Its neighbours are A3, the 1 to its right, and C1, the 2 below it.
Try it
Where does the bridge from A1 go?
- To A3, the 1 beside it
- To C1, the 2 below it
Show the answer
To C1, the 2 below it
Right. Joining A1 to A3 would make a finished pair cut off from the rest, because both are 1s. So A1's one bridge goes to C1.
Enable JavaScript to answer interactively and save your place.
Practice Bridge the islands