Bridges
Connect the island network with straight horizontal and vertical bridges into one united world.
Basic Game Premise & Rules
MechanicsBridges is an untimed, deterministic pencil-and-paper logic puzzle played on a grid. Every valid puzzle has exactly one unique solution that can be discovered through rigorous deductive reasoning alone, without trial and error or guessing.
- The puzzle is played on a grid containing circular numbered 'islands' surrounded by water.
- Bridges must be straight horizontal or vertical lines connecting pairs of islands.
- Bridges cannot cross other bridges and cannot pass through intermediate islands.
- At most two bridges can run between any pair of islands (bridges are drawn as either single or double lines).
- The number on each island specifies the exact total number of bridges connected to it.
- Single United Network: All islands must be connected together into a single continuous network (a connected spanning graph with no isolated island groups).
Rules by Example
See how each rule looks when done correctly versus when violated:
Island Bridge Counts & Max 2 Bridges
Every island must connect to exactly as many bridges as its number indicates. At most two bridges can run between any pair of islands.
No Crossing Bridges & Single Connected Network
Bridges can never cross other bridges, and all islands must be connected together into a single continuous network.
History & Origins
Origins & EvolutionBridges (Hashiwokakero) was first published by Nikoli in *Puzzle Communication Nikoli* #31 in Autumn 1990. Conceived as an elegant topological network challenge, it transformed the abstract mathematical concept of graph degree realization into a tactile pencil puzzle.
Hashiwokakero became one of Nikoli's signature international exports. Known simply as **Hashi** or **Bridges**, it became a regular feature in mainstream publications such as *The Times* (London) and *The New York Times*, while also inspiring numerous computer adaptations (including Simon Tatham's Portable Puzzle Collection). Its widespread appeal lies in its clean visual mechanics: solvers experience the satisfaction of watching isolated archipelagoes progressively weave into a unified, interconnected empire.
Mathematical Concepts & Computational Complexity
Computer Science & Discrete MathBeyond its entertainment value, Bridges formalizes core principles of discrete mathematics, theoretical computer science, and combinatorics:
Degree Realization on Geometric Multigraphs
Bridges is a geometric variation of the classic Graph Degree Sequence Problem (Erdős–Gallai and Havel–Hakimi theorems). Given a set of vertices V embedded in the integer plane with prescribed degrees d: V → {1, ..., 8}, the objective is to find a connected multigraph G = (V, E) of edge multiplicity at most 2 whose edges are axis-aligned non-crossing line segments. Planarity and non-crossing constraints elevate this from a polynomial linear algebraic problem into a hard geometric optimization.
NP-Completeness via Planar Hamiltonian Cycles
In 2009, Daniel Andersson published a proof in *Information Processing Letters* establishing that deciding the solvability of Hashiwokakero is NP-complete. Andersson constructed a reduction from the Hamiltonian Cycle problem in planar cubic graphs. The reduction establishes that even when island degrees are strictly bounded and the grid structure is planar, determining bridge placement requires exponential time in the worst case.
Planar Cuts & Spanning Tree Constraints
The global connectivity requirement mandates that the final bridge graph contains a spanning tree covering all islands. Solvers exploit cut-set inequalities: if a subset of islands S ⊂ V has total internal degree requirement Σ_{v∈S} d(v) that is too small or whose bridges would isolate S from V \ S, early bridge closures are forbidden. For example, two islands with clue '1' cannot connect to each other unless they are the only two islands on the board.
Pigeonhole Degree Capacity & Force Deductions
Fundamental deduction rules emerge from capacity bounds. An island with clue 8 must place 2 bridges to each of its 4 orthogonal neighbors. An island with clue 7 facing 4 neighbors must place at least 1 bridge to every neighbor. Similarly, corner and edge islands with limited available neighbors (degree capacity 2 or 4) immediately force bridge directions.
References & Further Reading
Bibliography- Andersson, D. (2009). 'Hashiwokakero is NP-complete'. Information Processing Letters, 109(19), 1145–1146.
- Nikoli (1990). Puzzle Communication Nikoli #31. Tokyo: Nikoli Publishing.
- Hearn, R. A., & Demaine, E. D. (2009). Games, Puzzles, and Computation. CRC Press. ISBN: 978-1568813226.
- Baste, J., Goldschmidt, O., & Vialette, S. (2017). 'On the Parameterized Complexity of Hashiwokakero'. Discrete Applied Mathematics, 217, 393–404.
- Tatham, S. (2004). 'Bridges'. Simon Tatham's Portable Puzzle Collection.
Free Printable PDF Booklet
Download our beautifully formatted, high-resolution A4 puzzle booklet. Generated directly from the handcrafted levels on AZTest, it contains 50 puzzles ordered from gentle introductory boards up to master-level challenges, followed by complete solutions at the back.
| Difficulty Stage | Grid Size | Description | Puzzles |
|---|---|---|---|
| Intro | 6×6 | Small archipelagoes demonstrating single/double bridge basics. | 3 |
| Easy | 6×6 to 7×7 | Corner and edge capacity forces with clear paths. | 12 |
| Medium | 8×8 to 10×10 | Network connectivity analysis and cut prevention. | 12 |
| Hard | 10×10 to 12×12 | Dense island clusters with long-distance bridge crossings. | 12 |
| Expert | 12×12 | Sprawling archipelagoes demanding global topological deduction. | 11 |
Explore More Logic Puzzles
SeriesSlitherlink
Connect dots to draw a single unbroken loop guided by surrounding cell numbers.
Wolves & Sheep
Draw a Slitherlink loop that fences the gentle sheep in and keeps the fierce wolves out.
Masyu
Draw one closed loop through cell centres that rigorously obeys the black and white pearls.
Nurikabe
Shade the sea to leave numbered white islands of exact sizes in one connected ocean.
Nonogram
Shade runs of cells according to row and column number clues to reveal a hidden picture.
Themed Nonogram
Solve color picture cross puzzles that blossom into vibrant pixel art upon completion.
Hitori
Shade the repeated numbers until every row and column has unique digits, keeping all white cells connected.
Kurodoko
Shade cells so every numbered circle sees exactly that many white cells in its row and column.
Mosaic
Shade cells guided by numbers that count how many cells around them are filled, revealing a hidden picture.
Binairo
Fill every cell with blue or white circles: never three in a row, every line half and half.
Heyawake
Shade rooms according to their clues without isolating unshaded cells or leaving long straight corridors.
Searchlights
Place light beams in white cells so that every numbered black post sees its exact clue count.
Light Up
Place light bulbs to illuminate every white cell without any two shining on each other.
Calcudoku
A Latin square where every outlined cage satisfies its arithmetic target and operator.
Skyscrapers
Place towers of heights 1 to N so that each outside clue sees the exact count of buildings.
Sum Skyscrapers
Skyscrapers where each outside clue is the sum of the heights of all visible buildings.
Suguru
The elegant polyomino number puzzle where no two identical digits can touch, even diagonally.
Futoshiki
A Latin square puzzle with inequality signs pointing between neighboring numbers.
Fillomino
Divide the grid into polyomino blocks where each cell's number equals the area of its block.
Galaxies
Partition the grid into rotational 180° symmetric galaxies, each centered on a single dot.
Shikaku
Cut the whole grid into rectangles and squares, each containing exactly one number: its area.
L-Pieces
Draw borders to partition all white cells into perfect four-cell L-shapes.
Numberlink
Connect pairs of matching numbers with continuous non-crossing paths covering the grid.
Slant
Draw a diagonal slash in every cell matching the corner numbers, without ever closing a loop.
Tents
Pitch a tent beside every tree with no two tents touching, matching row and column counts.
Marupeke
Place circles and crosses in every cell without creating three in a row in any direction.