Hashi Bridges Puzzle Generator screenshot

Hashi Bridges Puzzle Generator

Generate a Hashiwokakero network of numbered islands and bridges, proved to have one solution.

Privacy First
0 Runs
Updated 2026-11-22
Runs in your tab
No upload
Proven answer
Print and text download

What this page makes

Builds a Hashiwokakero board: numbered islands, single or double bridges between aligned neighbours, no crossings, one connected group, and a solver that proves the network unique.

How to use it

Choose the board size and difficulty, then press Generate. Each circle is an island and its number is how many bridge ends it needs. Connect pairs of islands that are in the same row or column with one or two parallel bridges; bridges may not cross and the finished network must join every island into one group.

Worked example: 9×9 board, medium difficulty, seed hashi-demo becomes a board of 12 numbered islands with one proved network and the bridges drawn under it.

What it proves

Islands are placed on a coarse lattice and a random spanning tree is built only between islands that see each other along a row or column. Bridge counts of one or two are assigned to the tree, a couple of extra bridges are added, and the result is rejected if any island's count is outside 1 to 8 or a horizontal bridge crosses a vertical one. The solver branches on bridge counts with degree-sum bounds and a final connectivity check.

What it refuses

A seed that cannot be proved unique inside the node budget and eighty networks is refused; the page keeps the seed so it can be changed.

Where it runs

The puzzle is generated and solved in this tab: there is no upload, no network request, no stored seed and no model, so nothing you type leaves your device. The same seed and options rebuild the same puzzle exactly.

The rest of the family

The other puzzle generators are listed under Tabletop & Game Tools: killer sudoku, kakuro, KenKen, futoshiki, nonograms, slitherlink, Hashi, word search, crossword, magic squares and buzzword bingo.

Builds a Hashiwokakero board: numbered islands, single or double bridges between aligned neighbours, no crossings, one connected group, and a solver that proves the network unique.

Islands are placed on a coarse lattice and a random spanning tree is built only between islands that see each other along a row or column. Bridge counts of one or two are assigned to the tree, a couple of extra bridges are added, and the result is rejected if any island's count is outside 1 to 8 or a horizontal bridge crosses a vertical one. The solver branches on bridge counts with degree-sum bounds and a final connectivity check. Every puzzle is generated, solved or checked in this tab: there is no upload, no network request, no stored seed and no model, so nothing you type leaves your device.

Worked example: 9×9 board, medium difficulty, seed hashi-demo becomes a board of 12 numbered islands with one proved network and the bridges drawn under it.

Before the puzzle is shown, the same solver is run over it: the answer, the solution count and the node cap are printed under the board, so the proof is checkable rather than promised.

How to use the hashi bridges puzzle generator

Choose the board size and difficulty, then press Generate. Each circle is an island and its number is how many bridge ends it needs. Connect pairs of islands that are in the same row or column with one or two parallel bridges; bridges may not cross and the finished network must join every island into one group.

Every puzzle is generated, solved or checked in this tab: there is no upload, no network request, no stored seed and no model, so nothing you type leaves your device.

  • Board size — one of 7, 9, 11
  • Difficulty — one of easy, medium, hard
  • Seed (blank draws one) — typed text

What the page proves

Builds a Hashiwokakero board: numbered islands, single or double bridges between aligned neighbours, no crossings, one connected group, and a solver that proves the network unique.

Islands are placed on a coarse lattice and a random spanning tree is built only between islands that see each other along a row or column. Bridge counts of one or two are assigned to the tree, a couple of extra bridges are added, and the result is rejected if any island's count is outside 1 to 8 or a horizontal bridge crosses a vertical one. The solver branches on bridge counts with degree-sum bounds and a final connectivity check.

  • Domain: 7×7, 9×9 and 11×11 boards; island counts are 1 to 8 and every bridge is horizontal or vertical.
  • The seed is printed with the puzzle and rebuilds it exactly: the same seed and options always produce the same grid.
  • A generation that cannot prove its answer inside the stated node cap is refused with the seed kept, rather than printed with an unchecked answer.

What it refuses, and what it leaves out

A seed that cannot be proved unique inside the node budget and eighty networks is refused; the page keeps the seed so it can be changed.

  • Not the right page for: a board with diagonal bridges
  • Not the right page for: a puzzle with islands of count zero

What to Expect

Best for

  • a bridge-drawing logic puzzle
  • a grid with no arithmetic
  • a printable table puzzle

Not ideal for

  • a board with diagonal bridges
  • a puzzle with islands of count zero

What this tool keeps

  • every island count
  • the no-crossing rule
  • the one-network proof

What may need cleanup

  • printing before opening the answer key
  • choosing a larger board when the network is dense

Common errors

  • two bridges are the maximum between a pair
  • a network with two components is refused

Example use cases

  • a puzzle break
  • a classroom deduction task
  • a printed puzzle page

Sample input

9×9 board, medium difficulty, seed hashi-demo

Sample output

a board of 12 numbered islands with one proved network and the bridges drawn under it

Who this is for

  • Logic-puzzle players
  • Teachers
  • Commuters

Frequently asked questions

Is my data sent anywhere?

Every puzzle is generated, solved or checked in this tab: there is no upload, no network request, no stored seed and no model, so nothing you type leaves your device.

What can I download or print?

Print shows the puzzle and, if you open it, the answer key. Download writes a plain text file with the seed, the facts the page proved and the answer key; both are produced in this tab and neither is uploaded.

Why does the page print a seed?

So a puzzle can be rebuilt exactly. The same seed and the same options give the same puzzle on any machine, because the only randomness is a hash of the seed. Leave the field blank for a fresh one; the seed that was used is written back into the field.

What does the number on an island mean?

It is the total number of bridge ends at that island: a single bridge contributes one to each end, a double bridge two. The printed solution is checked so every island's bridges add up to its number.

Can two islands have more than two bridges?

No. Hashi allows one or two bridges between a pair, and the page never draws three. It also rejects a layout where a horizontal and a vertical bridge would cross.

Must every island be connected?

Yes. The generator builds a spanning tree first, so the network is connected by construction, and the solver's final check rejects any solution with a separate component.

Developer program

Build custom tools for your store

Join the SDK program to create useful ecommerce utilities for your store.