← Play Sliding Puzzle

Sliding Puzzle Solving Methods & Algorithms: From Beginner to A* Search

The definitive guide to sliding puzzle algorithms — from the band method beginners learn first, through parity mathematics and Manhattan distance, all the way to the A* search that powers computer solvers. Every technique explained, with drills you can practice in our free sliding puzzle.

<h2>Introduction: Why "Sliding Tiles Randomly" Never Works</h2>
<p>If you have ever spent ten minutes on a 15-puzzle only to find that placing tile 8 broke tile 7, you already know the problem. The sliding puzzle has 16 positions and 16! / 2 possible states — roughly 10 trillion configurations. You cannot solve it by reaction. You need a <strong>method</strong> that guarantees progress, regardless of how scrambled the starting position is.</p>

<figure>
  <img src="/assets/img/screenshots/sliding-puzzle-gameplay.png" alt="Sliding puzzle mid-game: the band method solves one row at a time, shrinking the puzzle progressively" width="800" height="600" loading="lazy">
  <figcaption>Mid-game state using the band method: tiles 1-3 (top row) are solved and locked, while the remaining tiles are reorganized into a smaller 3×4 working area. Each solved band is never broken again.</figcaption>
</figure>

<p>This guide organizes every serious solving method into four tiers: beginner algorithms anyone can learn in five minutes, intermediate strategies used by speed-solvers, the mathematical foundations that explain <em>why</em> some positions are unsolvable, and the computer-science algorithms (A*, IDA*, pattern databases) that find optimal solutions. Each tier builds on the previous one. If you are brand new to the puzzle, start with our <a href="/guides/how-to-play-sliding-puzzle/">how to play sliding puzzle</a> guide first; if you want a quick step-by-step recipe without the theory, the <a href="/guides/beat-15-puzzle/">beat the 15-puzzle</a> guide covers the band method in five minutes.</p>

<h2>Tier 1: Beginner Algorithms</h2>
<p>These three methods solve any standard 15-puzzle without any mathematical background. Pick one, practice it on a <a href="/games/sliding-puzzle/">3x3 board</a>, then scale up.</p>

<h3>1. The Band Method (Row-by-Row)</h3>
<p>The band method is the most widely taught algorithm because it reduces a 2D problem to a series of 1D problems. You solve one complete row (a "band") at a time, shrinking the puzzle as you go.</p>
<p><strong>The algorithm:</strong></p>
<ol>
  <li><strong>Top row first.</strong> Place tile 1 in the top-left corner, then tiles 2 and 3 beside it. The trick: place tile 3 <em>below</em> its target, then rotate it up using the empty space to the right of tile 2.</li>
  <li><strong>Left column next.</strong> Place tiles 4 (and 5 on a 4x4) down the left edge using the same rotate-into-place technique.</li>
  <li><strong>Reduce and repeat.</strong> With the top row and left column solved, the remaining 3x3 (or 2x3) area is treated as a smaller puzzle. Repeat until only a 2x2 or 2x3 block remains.</li>
  <li><strong>Final block.</strong> The last few tiles are solved as a unit using a cycling pattern — never place them one at a time.</li>
</ol>
<p><strong>Why it works:</strong> Each solved band is never broken again. The puzzle shrinks predictably, so you always know exactly what to do next. Average solve length is 80-120 moves for a 4x4.</p>

<div class="sp-visual">
  <p class="sp-visual-title">Band Method Progression — visualized on a 4×4 board</p>
  <div class="sp-board-wrap">
    <div class="sp-board-label">After Phase 1: Top row solved</div>
    <div class="sp-board">
      <div class="sp-cell sp-solved">1</div><div class="sp-cell sp-solved">2</div><div class="sp-cell sp-solved">3</div><div class="sp-cell sp-working">5</div>
      <div class="sp-cell sp-working">4</div><div class="sp-cell sp-working">7</div><div class="sp-cell sp-working">6</div><div class="sp-cell sp-working">8</div>
      <div class="sp-cell sp-working">9</div><div class="sp-cell sp-working">11</div><div class="sp-cell sp-working">10</div><div class="sp-cell sp-working">12</div>
      <div class="sp-cell sp-working">13</div><div class="sp-cell sp-working">14</div><div class="sp-cell sp-blank">∅</div><div class="sp-cell sp-working">15</div>
    </div>
  </div>
  <div class="sp-board-wrap">
    <div class="sp-board-label">After Phase 2: Top row + left column solved (puzzle reduced to 3×3)</div>
    <div class="sp-board">
      <div class="sp-cell sp-solved">1</div><div class="sp-cell sp-solved">2</div><div class="sp-cell sp-solved">3</div><div class="sp-cell sp-working">7</div>
      <div class="sp-cell sp-solved">4</div><div class="sp-cell sp-working">5</div><div class="sp-cell sp-working">6</div><div class="sp-cell sp-working">8</div>
      <div class="sp-cell sp-solved">9</div><div class="sp-cell sp-working">10</div><div class="sp-cell sp-working">11</div><div class="sp-cell sp-working">12</div>
      <div class="sp-cell sp-solved">13</div><div class="sp-cell sp-working">14</div><div class="sp-cell sp-working">15</div><div class="sp-cell sp-blank">∅</div>
    </div>
  </div>
  <div class="sp-legend">
    <span class="sp-legend-item"><span class="sp-swatch sp-solved"></span>Solved (locked)</span>
    <span class="sp-legend-item"><span class="sp-swatch sp-working"></span>Working area</span>
    <span class="sp-legend-item"><span class="sp-swatch sp-blank"></span>Blank</span>
  </div>
  <p class="sp-caption">Each solved band (green) is never broken again. The working area shrinks from 4×4 → 3×3 → 2×2, making each phase simpler than the last.</p>
</div>

<h3>2. The Corner-First Method</h3>
<p>Instead of rows, you solve all four corners first (tiles 1, 3, 13, 15 on a standard 4x4). Corners are the hardest tiles to place later because they have two fixed neighbors. Once the frame is locked, the interior edges and center fill in with far less backtracking.</p>
<p><strong>Best for:</strong> players who find the last-row breakage problem frustrating. Corner-first eliminates that problem entirely by solving the most constrained positions first.</p>

<h3>3. The Edge-Pair Method</h3>
<p>Pair each edge tile with its adjacent corner, then slot the pair in together. This is the sliding-puzzle equivalent of the "F2L" (First Two Layers) technique from speed-cubing. It requires more look-ahead than the band method, but produces shorter solutions.</p>

<table class="sp-method-table">
  <caption>Beginner Method Comparison — pick the algorithm that matches your thinking style</caption>
  <thead>
    <tr>
      <th>Method</th>
      <th>Solve Order</th>
      <th>Avg Moves</th>
      <th>Best For</th>
      <th>Difficulty</th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td><strong>Band Method</strong></td>
      <td>Row → Column → Shrink → Repeat</td>
      <td>80–120</td>
      <td>Absolute beginners; predictable steps</td>
      <td>⭐ Easy</td>
    </tr>
    <tr>
      <td><strong>Corner-First</strong></td>
      <td>4 Corners → Edges → Center</td>
      <td>70–100</td>
      <td>Players who struggle with last-row breakage</td>
      <td>⭐⭐ Medium</td>
    </tr>
    <tr>
      <td><strong>Edge-Pair</strong></td>
      <td>Corner + Edge pairs → Slot together</td>
      <td>60–90</td>
      <td>Speed-solvers with strong look-ahead</td>
      <td>⭐⭐⭐ Hard</td>
    </tr>
  </tbody>
</table>

<h2>Tier 2: Speed-Solving Techniques</h2>
<p>Once you can solve a 4x4 consistently, these three techniques cut your time dramatically.</p>

<h3>Look-Ahead</h3>
<p>Beginners solve one tile, stop, find the next tile, solve it, stop again. Speed-solvers never pause. While executing the moves for tile 3, their eyes are already tracking tile 4 and planning its placement sequence. This is the single biggest time-saver — most of the gains from practice come from shrinking the pause between tiles, not from faster finger movement.</p>

<h3>Move Efficiency</h3>
<p>Track your move count. A typical beginner 4x4 solve takes 150-200 moves. An efficient band-method solve takes 80-100 moves. The difference is wasted backtracking — every time you move a solved tile out of the way and put it back, you are spending 4-6 moves that could have been avoided by a better placement sequence. Practice each band until the optimal sequence becomes muscle memory.</p>

<h3>The 2x3 Cycling Algorithm</h3>
<p>The last block (usually a 2x3 region in the bottom-right) is where most time is lost. The correct technique cycles all six tiles through a fixed loop: move the blank around the perimeter of the block in one direction, and the tiles will rotate through the loop without disturbing the rest of the board. Memorize the 8-move cycle, and the final stage becomes nearly automatic.</p>

<h2>Tier 3: The Mathematics of Sliding Puzzles</h2>
<p>Understanding the math explains <em>why</em> certain puzzles behave the way they do, and prevents the wasted effort of trying to solve impossible positions.</p>

<h3>Permutation Parity</h3>
<p>Every sliding puzzle position belongs to one of two classes: solvable or unsolvable. The dividing line is a property called <strong>parity</strong>, computed by counting inversions. An inversion is any pair of tiles where the higher-numbered tile appears before the lower-numbered tile in reading order.</p>
<p><strong>Solvability test (even-width boards like 4x4):</strong></p>
<ul>
  <li>Count inversions (ignore the blank).</li>
  <li>Find the row of the blank, counting from the bottom (1-indexed).</li>
  <li>The position is solvable iff: (blank on even row from bottom AND inversions even) OR (blank on odd row from bottom AND inversions odd).</li>
</ul>
<p>For odd-width boards (3x3, 5x5), the rule is simpler: the position is solvable if and only if the inversion count is even.</p>
<p>This is why the classic "14-15 puzzle" (with tiles 14 and 15 swapped) is unsolvable — it has exactly one inversion, which fails the parity test on a 4x4 board regardless of blank position.</p>

<div class="sp-callout sp-callout-warn">
  <h4>The 14-15 Parity Trap: A Concrete Example</h4>
  <p>Take the classic impossible position: tiles 1-13 in order, then 15, 14, blank. Count inversions: only the (15, 14) pair is reversed → <strong>1 inversion</strong>. Blank is on row 4 (bottom), which is row 1 from the bottom (odd). Rule for 4×4: blank on odd row requires odd inversions. 1 is odd... but wait — the blank is actually in position (4, 3), which is row 4. Row 4 from top = row 1 from bottom (odd). Inversions = 1 (odd). Odd + odd = solvable?</p>
  <p><strong>No.</strong> The correct test: blank on odd row from bottom + <em>even</em> inversions, OR blank on even row from bottom + <em>odd</em> inversions. With blank on row 1 from bottom (odd) and 1 inversion (odd), this fails both conditions → <strong>unsolvable</strong>. This parity trap is why you should never trust a scrambled puzzle from a random physical toy — roughly half of all configurations are mathematically impossible to solve.</p>
</div>

<h3>God's Number</h3>
<p>In 2008, Richard Korf proved that every solvable 15-puzzle can be solved in at most <strong>80 moves</strong> (half-turn metric). This is the puzzle's "God's Number" — the longest shortest-solution among all solvable positions. For comparison, the 8-puzzle (3x3) has God's Number 31, and the 2x2 pocket cube has God's Number 11. Most random 15-puzzle shuffles require 50-70 moves for an optimal solution.</p>

<table class="sp-gods-table">
  <caption>God's Number Comparison — puzzle complexity grows exponentially with board size</caption>
  <thead>
    <tr>
      <th>Puzzle</th>
      <th>Board Size</th>
      <th>Total States</th>
      <th>God's Number</th>
      <th>Year Proven</th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td>8-Puzzle</td>
      <td>3×3</td>
      <td>181,440</td>
      <td><strong>31 moves</strong></td>
      <td>1999</td>
    </tr>
    <tr>
      <td>15-Puzzle</td>
      <td>4×4</td>
      <td>10.4 trillion</td>
      <td><strong>80 moves</strong></td>
      <td>2008</td>
    </tr>
    <tr>
      <td>24-Puzzle</td>
      <td>5×5</td>
      <td>7.7 × 10²⁴</td>
      <td>≥100 moves</td>
      <td>Not yet proven</td>
    </tr>
  </tbody>
</table>
<p class="sp-table-note">The 15-puzzle's God's Number of 80 means that even in the worst-case scenario, an optimal algorithm will never need more than 80 moves. This is the theoretical ceiling — most random positions require 50-70 moves.</p>

<h2>Tier 4: Computer Science Algorithms</h2>
<p>These are the algorithms that actually <em>compute</em> optimal solutions. You do not need to implement them by hand, but understanding them reveals what a "good" solve looks like.</p>

<h3>A* Search</h3>
<p>A* (pronounced "A-star") is the workhorse algorithm for shortest-path problems. It explores board states in order of f(n) = g(n) + h(n), where:</p>
<ul>
  <li><strong>g(n)</strong> = moves made so far</li>
  <li><strong>h(n)</strong> = a heuristic estimate of remaining moves</li>
</ul>
<p>As long as h(n) never overestimates (an "admissible" heuristic), A* guarantees the shortest solution. The quality of h(n) determines how fast A* finds it.</p>

<h3>Manhattan Distance Heuristic</h3>
<p>The simplest useful heuristic. For each tile, compute the number of horizontal plus vertical moves needed to reach its goal position, then sum across all 15 tiles. This is admissible because each move can reduce one tile's distance by at most 1 — so the sum is a lower bound on the true solution length. A* with Manhattan distance solves random 15-puzzles in seconds.</p>
<p><strong>Example:</strong> If tile 7 sits at position (row 2, col 3) and belongs at (row 2, col 1), its Manhattan distance is |2-2| + |3-1| = 2. Sum this for all tiles.</p>

<h3>Linear Conflict</h3>
<p>Manhattan distance underestimates because it assumes tiles move independently. Linear conflict adds a correction: when two tiles are in their goal row but reversed, at least two extra moves are required to pass them through each other. Adding 2 moves per conflict produces a tighter heuristic and dramatically fewer states explored.</p>

<h3>Pattern Databases</h3>
<p>The most powerful heuristic for the 15-puzzle pre-computes the exact solution length for every arrangement of a tile subset (for example, tiles 1-2-3-4 plus the blank). This table is then looked up during search as h(n). Korf's 2008 proof of God's Number used a combination of pattern databases — the "linear split" divides the 15 tiles into three groups and sums their pattern database values, with the maximum used as the heuristic.</p>

<h3>IDA* (Iterative Deepening A*)</h3>
<p>IDA* is the memory-efficient variant of A* that Korf introduced in 1985. Instead of keeping all explored states in memory, it runs depth-first search with a cost limit, then increases the limit and repeats. It finds the optimal solution using memory proportional to the search depth, not the search width. Combined with Manhattan distance + linear conflict + pattern databases, IDA* is the standard solver for 15-puzzle optimality proofs.</p>

<h2>Putting It All Together: A Practice Plan</h2>
<p>Theory only helps if you practice it. Here is a four-week plan that takes you from "random sliding" to "sub-2-minute 4x4 solves."</p>
<ol>
  <li><strong>Week 1:</strong> Learn the band method. Solve twenty 3x3 puzzles using only the algorithm. Target: consistent solves under 60 seconds.</li>
  <li><strong>Week 2:</strong> Move to 4x4. Focus on the rotate-into-place technique for placing tiles in the top row. Accept slow solves — accuracy before speed. Target: consistent solves under 5 minutes.</li>
  <li><strong>Week 3:</strong> Learn the 2x3 cycling algorithm for the final block. Track your move count. Target: move count below 120 per 4x4 solve.</li>
  <li><strong>Week 4:</strong> Introduce look-ahead. Practice solving two tiles' worth of moves in your head before executing. Target: sub-2-minute 4x4 solves.</li>
</ol>
<p>You can run every one of these practice sessions in our <a href="/games/sliding-puzzle/">sliding puzzle game</a> — it supports 3x3, 4x4, and 5x5, tracks your solve times, and always generates solvable positions.</p>

<h2>Common Mistakes (and the Algorithm That Fixes Them)</h2>
<ul>
  <li><strong>Breaking solved rows.</strong> Fix: commit to the band method. Never move a solved tile except as part of a planned cycle.</li>
  <li><strong>Chasing a single tile.</strong> Fix: place tiles as part of a row/column group, not individually.</li>
  <li><strong>Getting stuck on the last row.</strong> Fix: learn the 2x3 cycling algorithm; stop placing row tiles one at a time.</li>
  <li><strong>Wasting 50+ moves per solve.</strong> Fix: track move count and drill the top-row placement sequence until it is automatic.</li>
  <li><strong>Trying an unsolvable position.</strong> Fix: use the parity test above before investing time in a random shuffle.</li>
</ul>

<h2>Related Guides</h2>
<p>Once you master the sliding puzzle algorithm, these related guides extend your puzzle skills in different directions:</p>
<ul>
  <li><a href="/guides/sudoku-strategy-from-easy-to-expert/">Sudoku strategy from easy to expert</a> — constraint-based reasoning, similar to the parity logic used here.</li>
  <li><a href="/guides/minesweeper-advanced-techniques-patterns/">Minesweeper advanced patterns</a> — pattern recognition drills that sharpen the same look-ahead skill.</li>
  <li><a href="/guides/memory-match-techniques-improve-recall/">Memory Match recall training</a> — builds the visual memory that helps you track tile positions during look-ahead.</li>
  <li><a href="/guides/2048-strategy/">2048 strategy guide</a> — the "snake method" for 2048 uses the same row-first discipline as the band method.</li>
  <li><a href="/guides/advanced-puzzle-strategies-for-experts/">Advanced puzzle strategies for experts</a> — cross-game techniques for experienced solvers.</li>
  <li> — more brain-training options when you want a break from sliding tiles.</li>
  <li><a href="/guides/how-to-improve-concentration-with-games/">How to improve concentration with games</a> — the focus skills you build with sliding puzzles applied to daily life.</li>
</ul>

Frequently Asked Questions

<h3>What is the best method for beginners to solve a sliding puzzle?</h3>
<p>The band method (also called the row-by-row method) is the most reliable beginner approach. Solve the top row first, then the left column, and repeat on the smaller remaining square until you reach a 2x3 or 2x2 block. It reduces a 4x4 puzzle to a series of simple 1D placement problems. Practice on a <a href="/games/sliding-puzzle/">3x3 sliding puzzle</a> before moving up to 4x4 — the same algorithm scales perfectly.</p>

<h3>What is God's Number for the 15-puzzle?</h3>
<p>God's Number for the standard 15-puzzle is 80 moves in the half-turn metric (each slide counts as one move). This was proven by Richard Korf in 2008 using IDA* search with pattern databases. In practice, most random shuffles can be solved in 50-70 moves with an efficient method. If you are taking 150+ moves, you are doing a lot of backtracking — the speed drills in this guide will cut your move count quickly.</p>

<h3>How do you know if a sliding puzzle is solvable?</h3>
<p>Count the number of inversions (pairs of tiles that appear in reverse numerical order when you read the board left-to-right, top-to-bottom, ignoring the blank). On a 4x4 board with even width, add the row of the blank (counting from the bottom). The puzzle is solvable if and only if: (even width) blank on even row from bottom + even inversions, OR blank on odd row from bottom + odd inversions. On odd-width boards like 3x3, it is solvable if inversions are even. Our <a href="/games/sliding-puzzle/">sliding puzzle game</a> always generates solvable positions.</p>

<h3>What is the Manhattan distance heuristic used for?</h3>
<p>Manhattan distance is the most common heuristic for A* search on sliding puzzles. For each tile, you calculate how many horizontal and vertical moves it needs to reach its goal position, then sum all tiles. This sum is a lower bound on the actual number of moves needed — it never overestimates, which is why A* with Manhattan distance guarantees the shortest solution. For example, if tile 7 is two cells right and one cell above its target, its Manhattan contribution is 3.</p>

<h3>How can I solve a sliding puzzle faster?</h3>
<p>Three techniques cut solve times the most: (1) look-ahead — plan the next tile's placement while you are finishing the current one, so you never pause between moves; (2) move efficiency — most beginners waste 30-40% of moves by backtracking, so practice each placement sequence until it is muscle memory; (3) finger dexterity — on touch devices, use swipes rather than taps for 2-3x speed. Start with timed 3x3 solves on our <a href="/games/sliding-puzzle/">sliding puzzle</a>, then graduate to 4x4 once you can solve a 3x3 in under 60 seconds consistently.</p>

<h3>Why is the last row of a sliding puzzle so hard?</h3>
<p>The last row is hard because most players try to place each tile independently, which breaks previously-placed tiles. The correct technique is to solve the last row and last column together as a 2xN block using a cycling algorithm — you rotate tiles around a fixed loop until they all land in place simultaneously. This is the same principle used in the final stage of the <a href="/guides/beat-15-puzzle/">band method</a>, but applied with more awareness of which tiles must stay locked.</p>