Hashi (bridges) puzzles

What it is

Scattered across a grid are circled numbers, islands, and your task is to connect them all with bridges so that each island has exactly the number of bridges its number demands, without any bridge crossing another. Hashi, also known as Bridges or Hashiwokakero, is a logic puzzle in which you draw bridges between numbered islands following strict rules, until every island is correctly connected and the whole network forms one connected group. It is a purely visual, spatial logic puzzle with no arithmetic beyond counting, which gives it a distinctive, elegant feel.

The rules are few but produce rich deduction. Each island shows a number indicating how many bridges must connect to it; bridges run only horizontally or vertically in straight lines between two islands; at most two bridges may join any pair of islands; bridges may not cross each other or pass through islands; and, crucially, when finished all the islands must be linked into a single connected network. These constraints interact to make every well-formed puzzle solvable by logic alone.

The pleasure lies in the spatial reasoning. Solving means working out which connections are forced, an island showing a high number relative to its few neighbours often must use double bridges, and tracing how the no-crossing and single-network rules eliminate possibilities. The puzzle has a satisfying, almost architectural quality, since you are literally building a connected structure, and the "all one network" rule adds a clever global constraint that can resolve otherwise ambiguous spots.

It costs little, found in puzzle books and free apps, needs only a pencil or a screen, and suits anyone who enjoys visual logic puzzles and a change from number grids. The combination of simple rules, genuinely spatial deduction, and the elegant goal of building one connected island network makes Hashi bridges puzzles an absorbing and refreshing mind-at-play pursuit.

How it works

Learn the handful of rules and start with an easy grid, because Hashi's logic is intuitive once the constraints are clear. The rules: connect numbered islands with straight horizontal or vertical bridges; each island must have exactly its number of bridge ends; at most two bridges join any pair; bridges cannot cross or pass through islands; and all islands must end up in one connected network. Begin with a small, easy puzzle in a book or app to get a feel for how the constraints interact.

Look for forced connections to start. Certain islands compel particular bridges: an island whose number equals the maximum it could possibly take given its neighbours must use all those bridges, for instance a central island numbered eight must double-bridge all four neighbours, and an island numbered three with only two neighbours has limited options. Identify these forced bridges first and draw them in, since they give certain footholds. Marking how many bridges each island still needs as you go helps track progress.

Deduce the rest using the no-crossing and single-network rules. Once forced bridges are placed, they constrain their neighbours, reducing options elsewhere in a chain of deduction. The no-crossing rule eliminates bridges that would intersect ones already drawn, and the all-one-network rule lets you reject any connection that would prematurely seal off an isolated closed group. Work systematically, returning to islands whose remaining needs are now forced. With patience these rules always lead to the unique solution, so no guessing is required.

Use the rule that all islands must form one connected network to rule out connections that would seal off a separate closed loop, since this global constraint resolves spots that local counting alone cannot.

Benefits

Elegant Spatial Logic Rich Deduction From Simple Rules No Arithmetic Beyond Counting Satisfying Network-Building Goal Difficulty Scales Widely Screen-Free on Paper Cheap or Free to Play

What you need

Here's what to gather before you start. The essentials are marked.

Some links below are affiliate links. As an Amazon Associate, trylii.com earns from qualifying purchases, at no extra cost to you.

Hashi puzzles: from books or apps

A pencil: to draw and erase bridges

SuggestedAffiliate

Pencil

View on Amazon

An eraser: since deduction involves corrections

SuggestedAffiliate

Eraser

View on Amazon

The core rules: bridge counts, no crossing, one network

A way to track needs: noting bridges each island still requires

A quiet moment: to concentrate on the deduction

Patience: especially for the larger grids

FAQs

What are the rules of Hashi?

Connect numbered islands with bridges under a few constraints. Each island must have exactly the number of bridges its number shows; bridges run only horizontally or vertically in straight lines between two islands; at most two bridges may join any pair of islands; bridges may not cross each other or pass through islands; and when finished, all islands must form a single connected network. These few rules interact to make each proper puzzle solvable by logic alone, with the connected-network requirement adding a clever global constraint on top of the local bridge counts.

Is there any maths involved?

Only counting, no real arithmetic. You simply track how many bridges each island requires and how many it still needs, which involves basic counting rather than calculation. This makes Hashi a purely visual and spatial logic puzzle, distinct from number puzzles like Kakuro or KenKen that involve sums. The challenge comes from spatial deduction, working out which connections are forced and how the no-crossing and single-network rules eliminate options, so people who prefer logic and spatial reasoning over arithmetic often find Hashi especially appealing.

How do I start solving one?

Look for forced connections, especially at high-numbered islands. An island whose number equals the maximum bridges it could possibly take given its neighbours must use all of them, for example a central island numbered eight must double-bridge all four neighbours, since that is the only way to reach eight. These forced bridges give certain footholds with no guesswork. Place them first, note how many bridges each island still needs, and let those certainties constrain neighbouring islands, which sets off a chain of deduction that gradually resolves the grid.

How does the "one network" rule help?

It lets you reject connections that would isolate a closed group. Since all islands must end up in a single connected network, any bridge that would seal off a separate, self-contained cluster, leaving it unable to join the rest, can be ruled out even if it otherwise satisfies the local bridge counts. This global constraint resolves ambiguous spots that counting alone cannot, making it a powerful solving tool late in a puzzle. Keeping the single-network requirement in mind, alongside the no-crossing rule, is often what cracks the trickier deductions.