🌉 Connect the Islands

Hashiwokakero challenges you to connect numbered islands with bridges—pure spatial logic and graph theory in puzzle form.

Play Sudoku Now →

Hashiwokakero Bridge Puzzles: Complete Guide to Island Connection Logic

Master the Nikoli puzzle where numbered islands, straight bridges, and connectivity constraints create elegant solving chains.

1. What Is Hashiwokakero?

Hashiwokakero (橋をかけろ, literally "build bridges") is a graph connection logic puzzle created by the Japanese puzzle company Nikoli in 1990. It's also known simply as "Hashi" or "Bridges" in English.

The puzzle presents a grid of numbered circles (called "islands") that must be connected by horizontal or vertical lines (called "bridges"). Each island's number tells you exactly how many bridges must connect to it. The challenge is to satisfy all island numbers while ensuring no bridges cross and the entire network forms a single connected group.

Hashiwokakero's unique appeal lies in the tension between local bridge counting (satisfying each island's number) and global connectivity (ensuring all islands link together). This combination creates elegant deduction chains that are satisfying to unravel.

<div class="tip-box">
  <strong>💡 Why Multiple Names?</strong><br>
  The Japanese name "Hashiwokakero" (橋をかけろ) translates to "build bridges." Most English speakers shorten it to "Hashi" or call it "Bridges." All refer to the same puzzle — you'll see them used interchangeably.
</div>

2. The Three Rules of Hashiwokakero

Every Hashiwokakero puzzle, regardless of grid size or difficulty, follows exactly three rules. Master these and you can solve any puzzle.

<div class="rule-box">
  <strong>Rule 1 — Bridge Count:</strong> Each island's number tells you exactly how many bridges must connect to it. An island labeled "4" needs exactly 4 bridges total, spread across one or more neighboring islands. Bridges can be single (count as 1) or double (count as 2).
</div>

<div class="rule-box">
  <strong>Rule 2 — No Crossing:</strong> Bridges must run in straight horizontal or vertical lines. A horizontal bridge blocks any vertical bridge that would pass through the same space, and vice versa. Bridges cannot pass through other islands either.
</div>

<div class="rule-box">
  <strong>Rule 3 — Full Connectivity:</strong> When you finish, every island must be reachable from every other island by following bridges. No island or island cluster can be isolated. The entire bridge network must form a single connected group.
</div>

<div class="warn-box">
  <strong>⚠️ Bridge Placement Details:</strong><br>
  Two islands are neighbors if they share the same row or column with no other island between them. You can place either 1 bridge (single) or 2 bridges (double) between any pair of neighbors. There is no option for 3 bridges. A double bridge counts as 2 toward each island's required count.
</div>

<p>These three rules interact in subtle ways. Rule 1 ensures each island is satisfied, Rule 2 prevents spatial conflicts, and Rule 3 forces you to think about the global network structure. The art of solving Hashi lies in using island numbers as anchor points and then reasoning about where bridges must go to satisfy all three rules simultaneously.</p>

3. Anatomy of a Hashi Grid

Understanding the structure of a Hashiwokakero grid is essential before applying solving techniques. Let's dissect a sample grid:

<svg viewBox="0 0 500 300" role="img" aria-label="Hashiwokakero grid anatomy showing islands, bridges, and connectivity" title="Hashi Grid Anatomy">

  <rect x="0" y="0" width="500" height="300" fill="#0f1419"></rect>

  <circle cx="80" cy="80" r="25" fill="#1a2030" stroke="#4fc3f7" stroke-width="2"></circle>
  <text x="80" y="88" text-anchor="middle" fill="#4fc3f7" font-size="20" font-weight="bold">3</text>

  <circle cx="250" cy="80" r="25" fill="#1a2030" stroke="#4fc3f7" stroke-width="2"></circle>
  <text x="250" y="88" text-anchor="middle" fill="#4fc3f7" font-size="20" font-weight="bold">2</text>

  <circle cx="420" cy="80" r="25" fill="#1a2030" stroke="#4fc3f7" stroke-width="2"></circle>
  <text x="420" y="88" text-anchor="middle" fill="#4fc3f7" font-size="20" font-weight="bold">4</text>

  <circle cx="80" cy="220" r="25" fill="#1a2030" stroke="#4fc3f7" stroke-width="2"></circle>
  <text x="80" y="228" text-anchor="middle" fill="#4fc3f7" font-size="20" font-weight="bold">2</text>

  <circle cx="250" cy="220" r="25" fill="#1a2030" stroke="#4fc3f7" stroke-width="2"></circle>
  <text x="250" y="228" text-anchor="middle" fill="#4fc3f7" font-size="20" font-weight="bold">5</text>

  <circle cx="420" cy="220" r="25" fill="#1a2030" stroke="#4fc3f7" stroke-width="2"></circle>
  <text x="420" y="228" text-anchor="middle" fill="#4fc3f7" font-size="20" font-weight="bold">1</text>

  <line x1="105" y1="78" x2="225" y2="78" stroke="#81c784" stroke-width="3"></line>
  <line x1="105" y1="82" x2="225" y2="82" stroke="#81c784" stroke-width="3"></line>

  <line x1="275" y1="80" x2="395" y2="80" stroke="#81c784" stroke-width="3"></line>
  <line x1="275" y1="84" x2="395" y2="84" stroke="#81c784" stroke-width="3"></line>

  <line x1="105" y1="218" x2="225" y2="218" stroke="#81c784" stroke-width="3"></line>
  <line x1="105" y1="222" x2="225" y2="222" stroke="#81c784" stroke-width="3"></line>

  <line x1="275" y1="220" x2="395" y2="220" stroke="#81c784" stroke-width="3"></line>

  <line x1="248" y1="105" x2="248" y2="195" stroke="#81c784" stroke-width="3"></line>
  <line x1="252" y1="105" x2="252" y2="195" stroke="#81c784" stroke-width="3"></line>

  <line x1="420" y1="105" x2="420" y2="195" stroke="#81c784" stroke-width="3"></line>

  <text x="250" y="160" text-anchor="middle" fill="#8899aa" font-size="12">Double Bridge (counts as 2)</text>
  <text x="420" y="160" text-anchor="middle" fill="#8899aa" font-size="12">Single Bridge (counts as 1)</text>

  <text x="20" y="280" fill="#8899aa" font-size="11">Island numbers show required bridge count. All islands must connect into one network.</text>
</svg>

<p>Key elements of a Hashiwokakero grid:</p>
<ul>
  <li><strong>Islands:</strong> Numbered circles (1–8) scattered across the grid. Each number tells you exactly how many bridges must connect to that island.</li>
  <li><strong>Bridges:</strong> Straight horizontal or vertical lines connecting two islands. Can be single (1 bridge) or double (2 bridges). Cannot cross other bridges or pass through islands.</li>
  <li><strong>Neighbors:</strong> Two islands are neighbors if they share the same row or column with no other island between them. You can only place bridges between neighbors.</li>
  <li><strong>Connectivity:</strong> All islands must form a single connected network—you must be able to travel from any island to any other via bridges.</li>
</ul>

<table>
  <thead><tr><th>Grid Size</th><th>Islands (typical)</th><th>Difficulty</th><th>Typical Solve Time</th></tr></thead>
  <tbody>
    <tr><td>7×7</td><td>8–12</td><td>Easy</td><td>2–5 minutes</td></tr>
    <tr><td>10×10</td><td>15–25</td><td>Medium</td><td>5–15 minutes</td></tr>
    <tr><td>13×13</td><td>25–40</td><td>Hard</td><td>15–30 minutes</td></tr>
    <tr><td>15×15+</td><td>40–60</td><td>Expert</td><td>30+ minutes</td></tr>
  </tbody>
</table>

4. Seven Solving Techniques

These techniques progress from beginner to advanced. Master the first three to solve easy puzzles; all seven are needed for hard grids.

<h3>Technique 1: Start with Forced Bridges</h3>
<p>Some bridges are locked in before you make a single decision. Scan for these first:</p>
<ul>
  <li><strong>Value 1 with one neighbor:</strong> Must connect to that neighbor with a single bridge.</li>
  <li><strong>Value 8:</strong> Double bridges to all 4 neighbors (2+2+2+2=8). No other option.</li>
  <li><strong>Value 7 with 4 neighbors:</strong> Every neighbor gets at least one bridge, and three of them need doubles (2+2+2+1=7).</li>
  <li><strong>Value 4 in a corner (2 neighbors):</strong> Double bridges to both (2+2=4).</li>
  <li><strong>Value 3 with 2 neighbors:</strong> At least one bridge to each (the third bridge goes to one of them as a double).</li>
</ul>
<div class="tip-box">
  <strong>💡 Pro Tip:</strong> After placing forced bridges, immediately update the remaining capacity of each island. This triggers cascading deductions across the grid.
</div>

<h3>Technique 2: Count Remaining Capacity</h3>
<p>For each island, subtract the bridges already placed from the island's number. That's how many more bridges are needed. Now count how many bridges its remaining neighbors can accept. If those two numbers match, all remaining connections are forced.</p>
<p>Example: An island labeled "5" already has 2 bridges placed. It needs 3 more. If it has exactly 3 remaining neighbors that can each accept 1 bridge, all 3 connections are forced.</p>

<h3>Technique 3: Use Elimination</h3>
<p>When an island has more capacity than its remaining neighbors can absorb, at least one bridge to each neighbor is guaranteed.</p>
<p>Example: An island still needs 3 bridges and has 2 neighbors that can each accept up to 2. The total available is 4, the excess is 1, so each neighbor must get at least 1 bridge (2 minus 1 = 1 minimum each). Place those minimums and reassess.</p>

<h3>Technique 4: Watch for Isolation</h3>
<p>Every solved Hashi is one connected group. If removing a potential bridge would split the board into two disconnected halves, that bridge is required. This matters most on larger grids where clusters of islands can end up isolated if you're not careful.</p>
<p>Look for "chokepoints" where a single bridge is the only link between two regions of the grid.</p>

<h3>Technique 5: Parity Arguments</h3>
<p>An island with an odd number that has exactly two unsatisfied neighbors must give at least one bridge to each. This powerful constraint often unlocks chains of deductions.</p>
<p>Example: An island labeled "3" has 2 remaining neighbors. Even if one neighbor gets a double bridge (2), the other must get at least 1. So minimum bridges to each: 1.</p>

<h3>Technique 6: Crossing Conflicts</h3>
<p>Placing a horizontal bridge blocks every vertical bridge that would cross it. Sometimes you can prove a bridge must exist because the alternative would block a bridge that's required by another island.</p>
<p>This is indirect forcing: "If I don't place this bridge, it will block that required bridge, so I must place it."</p>

<h3>Technique 7: Connectivity Checkpoints</h3>
<p>Throughout the solve, periodically check that your bridge placements haven't created isolated clusters. If you notice a group of islands that can only connect to the rest via one bridge, that bridge is forced by Rule 3.</p>
<p>This is especially important near the end of a solve when most bridges are placed but a few critical connections remain.</p>

<svg viewBox="0 0 500 400" role="img" aria-label="Hashiwokakero solving techniques showing forced bridges and elimination" title="Hashi Solving Techniques">

  <rect x="0" y="0" width="500" height="400" fill="#0f1419"></rect>

  <text x="250" y="20" text-anchor="middle" fill="#4fc3f7" font-size="16" font-weight="bold">Forced Bridge Deductions</text>

  <text x="80" y="50" text-anchor="middle" fill="#8899aa" font-size="11">Corner "4" = forced doubles</text>
  <circle cx="80" cy="100" r="20" fill="#1a2030" stroke="#4fc3f7" stroke-width="2"></circle>
  <text x="80" y="106" text-anchor="middle" fill="#4fc3f7" font-size="16" font-weight="bold">4</text>

  <circle cx="180" cy="100" r="20" fill="#1a2030" stroke="#4fc3f7" stroke-width="2"></circle>
  <text x="180" y="106" text-anchor="middle" fill="#4fc3f7" font-size="16" font-weight="bold">?</text>

  <circle cx="80" cy="200" r="20" fill="#1a2030" stroke="#4fc3f7" stroke-width="2"></circle>
  <text x="80" y="206" text-anchor="middle" fill="#4fc3f7" font-size="16" font-weight="bold">?</text>

  <line x1="100" y1="98" x2="160" y2="98" stroke="#81c784" stroke-width="3"></line>
  <line x1="100" y1="102" x2="160" y2="102" stroke="#81c784" stroke-width="3"></line>

  <line x1="78" y1="120" x2="78" y2="180" stroke="#81c784" stroke-width="3"></line>
  <line x1="82" y1="120" x2="82" y2="180" stroke="#81c784" stroke-width="3"></line>

  <text x="130" y="90" fill="#81c784" font-size="10">2 bridges</text>
  <text x="60" y="150" fill="#81c784" font-size="10">2 bridges</text>

  <text x="350" y="50" text-anchor="middle" fill="#8899aa" font-size="11">"1" with one neighbor = forced</text>
  <circle cx="320" cy="100" r="20" fill="#1a2030" stroke="#4fc3f7" stroke-width="2"></circle>
  <text x="320" y="106" text-anchor="middle" fill="#4fc3f7" font-size="16" font-weight="bold">1</text>

  <circle cx="420" cy="100" r="20" fill="#1a2030" stroke="#4fc3f7" stroke-width="2"></circle>
  <text x="420" y="106" text-anchor="middle" fill="#4fc3f7" font-size="16" font-weight="bold">?</text>

  <line x1="340" y1="100" x2="400" y2="100" stroke="#81c784" stroke-width="3"></line>

  <text x="370" y="90" fill="#81c784" font-size="10">1 bridge (forced)</text>

  <text x="250" y="250" text-anchor="middle" fill="#8899aa" font-size="11">Elimination: needs 3, has 2 neighbors (max 2 each)</text>
  <circle cx="250" cy="300" r="20" fill="#1a2030" stroke="#4fc3f7" stroke-width="2"></circle>
  <text x="250" y="306" text-anchor="middle" fill="#4fc3f7" font-size="16" font-weight="bold">3</text>

  <circle cx="150" cy="300" r="20" fill="#1a2030" stroke="#4fc3f7" stroke-width="2"></circle>
  <text x="150" y="306" text-anchor="middle" fill="#4fc3f7" font-size="14" font-weight="bold">max 2</text>

  <circle cx="350" cy="300" r="20" fill="#1a2030" stroke="#4fc3f7" stroke-width="2"></circle>
  <text x="350" y="306" text-anchor="middle" fill="#4fc3f7" font-size="14" font-weight="bold">max 2</text>

  <line x1="170" y1="300" x2="230" y2="300" stroke="#81c784" stroke-width="3"></line>
  <line x1="270" y1="300" x2="330" y2="300" stroke="#81c784" stroke-width="3"></line>

  <text x="200" y="290" fill="#81c784" font-size="10">min 1</text>
  <text x="300" y="290" fill="#81c784" font-size="10">min 1</text>

  <text x="250" y="350" text-anchor="middle" fill="#ffb74d" font-size="11">Needs 3, has 4 capacity → each gets at least 1</text>

  <text x="20" y="385" fill="#8899aa" font-size="11">Green lines = bridges. Numbers show island requirements. Deductions cascade across the grid.</text>
</svg>

<table>
  <thead><tr><th>Technique</th><th>Difficulty</th><th>When to Use</th><th>Key Insight</th></tr></thead>
  <tbody>
    <tr><td>1. Forced Bridges</td><td>Beginner</td><td>Always, first step</td><td>High numbers + few neighbors = forced</td></tr>
    <tr><td>2. Count Capacity</td><td>Beginner</td><td>After placing initial bridges</td><td>Remaining need = remaining capacity</td></tr>
    <tr><td>3. Elimination</td><td>Easy</td><td>When capacity > neighbors</td><td>Excess forces minimums</td></tr>
    <tr><td>4. Isolation Watch</td><td>Easy</td><td>Throughout solve</td><td>One bridge = only link between regions</td></tr>
    <tr><td>5. Parity</td><td>Medium</td><td>Odd numbers, 2 neighbors</td><td>Odd + 2 neighbors = min 1 each</td></tr>
    <tr><td>6. Crossing Conflicts</td><td>Medium–Hard</td><td>When bridges block each other</td><td>Indirect forcing via blocked paths</td></tr>
    <tr><td>7. Connectivity Checks</td><td>Medium</td><td>Near end of solve</td><td>Chokepoints force critical bridges</td></tr>
  </tbody>
</table>

5. Step-by-Step Solving Walkthrough

Let's walk through a simplified Hashi solve to see how the techniques interact in practice.

<div class="tip-box">
  <strong>💡 Strategy:</strong> Always begin with Technique 1 (forced bridges). Look for islands with high numbers and few neighbors. These give you the most information with the least effort. Then move to capacity counting (Technique 2) and elimination (Technique 3).
</div>

<p><strong>Step 1 — Scan for forced bridges.</strong> Look for islands with values like 8, 7, or 4 in corners. Place all forced bridges immediately. An "8" anywhere must have double bridges to all 4 neighbors. A "4" in a corner (only 2 neighbors) must have double bridges to both.</p>
<p><strong>Step 2 — Update remaining capacity.</strong> After placing forced bridges, subtract the placed bridges from each island's number. Now you know how many more bridges each island needs. This often reveals new forced placements.</p>
<p><strong>Step 3 — Apply elimination.</strong> For each island, compare remaining need to remaining neighbor capacity. If an island needs 3 bridges and has 2 neighbors that can each accept up to 2, each neighbor must get at least 1 bridge (elimination logic).</p>
<p><strong>Step 4 — Check for isolation.</strong> Look for islands or clusters that can only connect to the rest via one bridge. That bridge is forced by the connectivity rule (Rule 3).</p>
<p><strong>Step 5 — Use parity arguments.</strong> For islands with odd numbers and exactly 2 remaining neighbors, apply parity logic: at least 1 bridge to each.</p>
<p><strong>Step 6 — Watch for crossing conflicts.</strong> If placing a horizontal bridge would block a required vertical bridge (or vice versa), you may need to reconsider your placement. Use crossing conflicts as indirect forcing.</p>
<p><strong>Step 7 — Iterate and check connectivity.</strong> Repeat Steps 2–6 until all islands are satisfied. Throughout the solve, periodically verify that your bridge network remains connected. If you notice isolated clusters, force the connecting bridges.</p>

6. Hashi vs Other Nikoli Puzzles

Hashiwokakero belongs to Nikoli's family of logic puzzles. Understanding how it relates to similar puzzles helps you choose which to learn next.

<table>
  <thead><tr><th>Feature</th><th>Hashiwokakero</th><th><a href="/guides/nurikabe-island-puzzle-rules/" style="color:var(--accent)">Nurikabe</a></th><th><a href="/guides/kakuro-number-crosswords/" style="color:var(--accent)">Kakuro</a></th><th><a href="/guides/heyewake-room-puzzle-tips/" style="color:var(--accent)">Heyawake</a></th></tr></thead>
  <tbody>
    <tr><td>Grid</td><td>Scattered numbered islands</td><td>Rectangular, no rooms</td><td>Cross-shaped, divided into runs</td><td>Rectangular, divided into rooms</td></tr>
    <tr><td>Core constraint</td><td>Bridge count + connectivity</td><td>Island size + connected sea</td><td>Sum equals clue</td><td>Room count + connectivity</td></tr>
    <tr><td>Unique rule</td><td>No crossing bridges</td><td>Sea cannot have 2×2 block</td><td>No repeat digit in a run</td><td>Three-room rule</td></tr>
    <tr><td>Cell states</td><td>Bridges (1 or 2) or empty</td><td>Binary (black/white)</td><td>Digits 1–9</td><td>Binary (black/white)</td></tr>
    <tr><td>Difficulty curve</td><td>Gentle → moderate</td><td>Moderate → steep</td><td>Moderate → steep</td><td>Gentle → steep</td></tr>
    <tr><td>Best for</td><td>Graph theory, spatial reasoning</td><td>Island/sea topology</td><td>Arithmetic + placement</td><td>Room-based spatial logic</td></tr>
  </tbody>
</table>

<p>If you enjoyed <a href="/guides/akari-lightbulb-puzzle-strategy/" class="internal-link">Akari</a>, Hashiwokakero is a natural next step—both involve spatial reasoning and constraint satisfaction, but Hashi adds graph connectivity and bridge counting. If you prefer arithmetic, try <a href="/guides/kakuro-number-crosswords/" class="internal-link">Kakuro</a>.</p>

7. Brain Training Benefits

Regular Hashiwokakero practice exercises multiple cognitive faculties simultaneously:

  • Graph theory reasoning: Thinking about networks, connections, and connectivity—the same skills used in computer science and logistics planning.
  • Spatial reasoning: Mentally tracking bridge paths and crossing conflicts, similar to skills used in Sokoban planning.
  • Constraint satisfaction: Holding three simultaneous rules in working memory and checking each candidate bridge against all of them.
  • Cascading deduction: Following chains of "if A then B then C" across the grid—the same skill used in critical thinking puzzles and Minesweeper.
  • Working memory: Tracking which islands are satisfied, which need more bridges, and which connections are forced—across multiple interacting constraint systems.
<div class="tip-box">
  <strong>💡 Transfer effect:</strong> Research shows that logic puzzle practice improves performance on unrelated tasks requiring working memory and executive function. Hashi's unique combination of bridge counting and graph connectivity may provide broader cognitive transfer than puzzles with only one type of constraint.
</div>

<p>Pair Hashi with other brain training activities on our site for a well-rounded cognitive workout: <a href="/guides/best-brain-training-games/" class="internal-link">best brain training games</a>, <a href="/guides/brain-games-focus/" class="internal-link">focus and concentration games</a>, or try our <a href="/games/sudoku/">Sudoku</a> for complementary number logic.</p>

8. FAQ

<div class="faq-item">
  <h3>What are the rules of Hashiwokakero?</h3>
  <p>Three rules: (1) Each island's number tells you exactly how many bridges must connect to it. (2) Bridges run horizontally or vertically and cannot cross each other or pass through islands. (3) All islands must form a single connected network—you must be able to travel from any island to any other via bridges.</p>
</div>

<div class="faq-item">
  <h3>What does "Hashiwokakero" mean?</h3>
  <p>Hashiwokakero (橋をかけろ) is Japanese for "build bridges." The name directly describes the puzzle's core mechanic: connecting numbered islands with bridges. Most English speakers shorten it to "Hashi" or call it "Bridges."</p>
</div>

<div class="faq-item">
  <h3>Can I place 3 bridges between two islands?</h3>
  <p>No. You can place either 1 bridge (single) or 2 bridges (double) between any pair of neighboring islands. There is no option for 3 bridges. A double bridge counts as 2 toward each island's required count.</p>
</div>

<div class="faq-item">
  <h3>What's the best grid size for beginners?</h3>
  <p>Start with 7×7 grids with 8–12 islands. These let you practice the basic deduction techniques (forced bridges, capacity counting) without overwhelming connectivity constraints. Move to 10×10 or larger once you're comfortable with elimination and isolation prevention.</p>
</div>

<div class="faq-item">
  <h3>What is a "forced bridge"?</h3>
  <p>A forced bridge is one that must exist based on the constraints, before you make any decisions. For example: an island with value 1 and only one neighbor—that bridge is 100% determined. An island with value 8 must have double bridges to all 4 neighbors. Scan for these first.</p>
</div>

<div class="faq-item">
  <h3>Is Hashi harder than Sudoku?</h3>
  <p>Different skills. Sudoku tests number placement and scanning. Hashi tests spatial reasoning and graph connectivity. Small Hashi grids can be easier than Sudoku; large ones (15×15 and up) are genuinely hard. Both develop logical deduction, but Hashi emphasizes network thinking while Sudoku emphasizes digit placement.</p>
</div>

<div class="faq-item">
  <h3>How is Hashi different from Nurikabe?</h3>
  <p>Both involve islands, but they're very different. Nurikabe requires you to shade cells so that white "islands" have specific sizes and the black "sea" is connected. Hashi requires you to connect numbered islands with bridges so that all islands form one network. Nurikabe is about shading; Hashi is about connecting.</p>
</div>

Explore More Puzzles on Funnyzz

If you enjoyed Hashiwokakero, check out these related guides and games: