2026-09-0812 min readGaming

How to Solve a Slide Puzzle: Complete Beginner's Guide (15 & 8 Puzzle Tutorial)

Can't solve your 15-puzzle or 8-puzzle? Learn the 4-step method and corner techniques for solvable sliding tile puzzles. Includes illustrations, parity checks, and our free solver.

#slide puzzle#15 puzzle#8 puzzle#how to solve#algorithm#solution guide

"I have almost every number in place, but the last two tiles are stuck!"

"Every time I try to move the final piece in, I mess up everything I already solved..."

Whether you are playing a mini-game, an escape room puzzle, or a classic physical sliding block game, this frustration is completely universal. Beginners often fall into the trap of randomly sliding tiles around, hoping that eventually, the numbers will magically align. However, random movements almost never lead to a solved puzzle.

Fortunately, solvable sliding tile puzzles can be completed by following a specific, mathematically established step-by-step method. Once you understand the fundamental strategy, you can confidently solve the puzzle without relying on luck. If you make a wrong preparation or place a tile incorrectly, you can simply back up a few moves and reconstruct the setup.

In this comprehensive guide, we break down the classic 4-step sliding puzzle solution with clear visual diagrams. The core mechanics discussed here apply primarily to the 4×4 board. For a 3×3 puzzle, the steps are adapted: the first row is 1–3, the lower-left vertical pair is 4 and 7, and the final remaining tiles are 5, 6, 8, and the blank space. Note that 5×5 boards are not supported in our examples.


§1. The Two Golden Rules of Slide Puzzles

Before jumping into the specific moves and techniques, you must understand the two fundamental rules that govern sliding puzzle strategy. Keeping these in mind will prevent the most common mistakes.

textCode
[Rule 1] Once a section is solved, try not to break it. If you must, revert it exactly.
[Rule 2] Reduce the puzzle's active size step-by-step (Row by Row, Column by Column).

Beginners almost always fail because they try to place all 15 numbers at the same time across the entire board. The secret to sliding puzzles is to shrink the active board continuously. You are systematically locking solved pieces into place and ignoring them for the rest of the puzzle.

  • For a 4x4 (15-puzzle) board:

1. Solve Row 1 (1 to 4) → You now only have a 3x4 active area left.

2. Solve Row 2 (5 to 8) → You now only have a 2x4 active area left.

3. Solve the Left Columns (9/13 and 10/14) → You now only have a 2x2 active area left.

4. Rotate the final 2x2 square to finish!

This step-by-step reduction makes the puzzle progressively easier to manage. Let's look at the exact procedures for each step.


§2. Step 1: Solve the First Row (1, 2, 3, 4)

Start with the top row from left to right.

In the diagrams below, [ ] represents undetermined areas (tiles that we don't care about right now). The unique blank space is denoted by [ _ ], and another specific tile that is in the way is denoted by [ A ].

textCode
[ 1 ][ 2 ][ 3 ][ 4 ]  <-- Target Row to complete
[   ][   ][   ][   ]
[   ][   ][   ][   ]
[   ][   ][   ][   ]
  • Tiles 1 and 2: These are extremely easy to place. Simply guide them to their home positions (top-left and next to it) using the massive open space available on the rest of the board.
  • Tiles 3 and 4 (The Corner Technique):
  • This is where everyone gets stuck. If you just place 3 in its spot, you won't have room to slide 4 in without breaking the 3.
  • Solution: You must prepare the board in the top-right 2x2 area. Place 3 where 4 belongs (top-right corner), and place 4 directly underneath it. The exact movements to reach this preparation depend on your current board layout; there is no magic teleportation or immediate tile swap.

Once you have achieved the preparation state below, you only use legal moves (sliding a tile adjacent to the blank space).

textCode
  [Preparation in top-right 2x2 area]
[ 1 ][ 2 ][ _ ][ 3 ]
[   ][   ][ A ][ 4 ]
[   ][   ][   ][   ]
[   ][   ][   ][   ]

Now, move 3 to the left:

textCode
  [Move 3 to the left]
[ 1 ][ 2 ][ 3 ][ _ ]
[   ][   ][ A ][ 4 ]
[   ][   ][   ][   ]
[   ][   ][   ][   ]

Finally, move 4 up:

textCode
  [Move 4 up to finish the row]
[ 1 ][ 2 ][ 3 ][ 4 ]
[   ][   ][ A ][ _ ]
[   ][   ][   ][   ]
[   ][   ][   ][   ]

Once Row 1 is complete, lock it down. Try your best not to touch these four tiles for the remainder of the puzzle.


§3. Step 2: Solve the Second Row (5, 6, 7, 8)

Use the exact same strategy for the second row as you did for the first.

textCode
[ 1 ][ 2 ][ 3 ][ 4 ]  <-- Locked Area
[ 5 ][ 6 ][ 7 ][ 8 ]  <-- Target Row
[   ][   ][   ][   ]
[   ][   ][   ][   ]
  • Carefully navigate 5 and 6 to their correct positions on the left side of the second row.
  • For 7 and 8, utilize the Corner Technique once again. Prepare the board in the rightmost 2x2 area of the active board.
textCode
  [Preparation in the right side 2x2 area]
[ 1 ][ 2 ][ 3 ][ 4 ]
[ 5 ][ 6 ][ _ ][ 7 ]
[   ][   ][ A ][ 8 ]
[   ][   ][   ][   ]

Move 7 to the left, and then move 8 up:

textCode
  [Move 7 left, then 8 up]
[ 1 ][ 2 ][ 3 ][ 4 ]
[ 5 ][ 6 ][ 7 ][ 8 ]
[   ][   ][ A ][ _ ]
[   ][   ][   ][   ]

Now the top half of the puzzle (numbers 1 through 8) is fully solved! The active area you need to worry about is now just a 2x4 rectangle at the bottom. This step is crucial because it further stabilizes the board and prepares you for the more constrained maneuvers in the bottom half. By locking in the first two rows, you have effectively solved 8 out of the 15 tiles. The remaining active area is now just 8 squares (7 tiles and 1 blank space), which drastically reduces the complexity of the puzzle and gives you a much clearer visual field to work with.


§4. Step 3: Solve the Bottom Rows by Vertical Pairs (9 & 13, 10 & 14)

This is an important step where many players encounter difficulties. It is recommended not to solve row 3 horizontally. If you try to place 9, 10, 11, and 12 from left to right, you may not have enough space to prepare the final tiles. Instead, solve the remaining 2x4 area as vertical columns working from left to right to ensure you have enough workspace.

textCode
[ 1 ][ 2 ][ 3 ][ 4 ]  <-- Locked
[ 5 ][ 6 ][ 7 ][ 8 ]  <-- Locked
[ 9 ][10 ][   ][   ]  <-- Solve as vertical pairs: (9, 13) and (10, 14)
[13 ][14 ][   ][   ]

How to pair 9 and 13:

We use a vertical version of the Corner Technique. Prepare the bottom-left 2x2 area by placing 9 exactly where 13 belongs (bottom-left slot), and placing 13 immediately to its right.

textCode
  [Preparation in bottom-left 2x2 area]
[ 1 ][ 2 ][ 3 ][ 4 ]
[ 5 ][ 6 ][ 7 ][ 8 ]
[ _ ][ A ][   ][   ]
[ 9 ][13 ][   ][   ]

From this prepared state, move 9 up:

textCode
  [Move 9 up]
[ 1 ][ 2 ][ 3 ][ 4 ]
[ 5 ][ 6 ][ 7 ][ 8 ]
[ 9 ][ A ][   ][   ]
[ _ ][13 ][   ][   ]

Then move 13 to the left:

textCode
  [Move 13 left to finish the pair]
[ 1 ][ 2 ][ 3 ][ 4 ]
[ 5 ][ 6 ][ 7 ][ 8 ]
[ 9 ][ A ][   ][   ]
[13 ][ _ ][   ][   ]

The first vertical column (9 and 13) is now securely in place!

Repeat for 10 and 14:

Adapt this exact technique for the next column. Prepare the 10 and 14 in the corresponding 2x2 area, move 10 up, and move 14 to the left.

textCode
  [Preparation in the next 2x2 area]
[ 1 ][ 2 ][ 3 ][ 4 ]
[ 5 ][ 6 ][ 7 ][ 8 ]
[ 9 ][ _ ][ A ][   ]
[13 ][10 ][14 ][   ]

  [Move 10 up, then 14 left]
[ 1 ][ 2 ][ 3 ][ 4 ]
[ 5 ][ 6 ][ 7 ][ 8 ]
[ 9 ][10 ][ A ][   ]
[13 ][14 ][ _ ][   ]

Now, only the bottom-right 2x2 square remains.


§5. Step 4: Rotate the Final 2x2 Square

You are now left with just a small 2x2 corner consisting of tiles 11, 12, 15, and the empty space:

textCode
[ 1 ][ 2 ][ 3 ][ 4 ]
[ 5 ][ 6 ][ 7 ][ 8 ]
[ 9 ][10 ][11 ][12 ]  <-- Simply cycle this 2x2 area!
[13 ][14 ][15 ][ _ ]

As long as the remaining tiles (11, 12, and 15) are in the correct cyclic order, all you need to do is use the blank space to rotate them clockwise or counter-clockwise until they fall into their respective home positions.

The direction of the rotation depends on the current layout of the tiles. Regardless of the direction, if the tiles are in the correct cyclic order, a few moves will align everything perfectly. If the final tiles do not align, first verify your initial input, the target layout, and the already fixed areas. If all other tiles are perfectly in place and exactly two tiles are swapped, this cannot occur through legal moves alone. In such cases, the board state is likely unsolvable, so please refer to Section 6.


§6. What if the Last Two Tiles are Swapped? (Unsolvable Boards)

If your entire puzzle is solved perfectly except for the very last two tiles (for example, 14 and 15 are swapped, or 11 and 12), the puzzle is mathematically impossible to solve.

In sliding tile mathematics (permutation parity), exactly 50% of uniform full valid random arrangements are unsolvable. This 50% rule applies specifically to generating every permutation with equal probability. Note that this does not mean every digital generator produces 50% unsolvable boards; games that shuffle via legitimate moves are always 100% solvable.

  • Parity Rules:
  • For a 3×3 board, the goal state is tiles 1–8 and one blank (0). The board is solvable if the inversion count (excluding 0) is even.
  • For a 4×4 board, the goal is tiles 1–15 and one blank (0). It is solvable if the sum of the inversion count and the row number of the empty space (counting from the bottom starting at 1) is odd.

Non-solvability is a fundamental mathematical property of the board state and differs entirely from an A* search limit failure. If your board fails the parity check, no algorithm can ever find a solution because one simply does not exist.


§7. Explore Solutions with Our AI Solver

Have a scrambled board and want to see the optimal step-by-step solution?

Try our 15-Puzzle Optimal Solver & Simulator to analyze your board. Our tool uses a pure A* (A-star) search algorithm combined with a Manhattan distance heuristic. It is an algorithmic search, not an LLM inference, ensuring precise pathfinding when possible.

Important Details & Limitations:

  • Input Requirements: You must input exactly one of each number for your grid size, including exactly one 0 representing the blank space.
  • Search Loop Caps: To prevent browser crashes, the algorithm has a strict loop limit of 30,000 iterations for 3×3 boards and 12,000 iterations for 4×4 boards. This means that for highly complex or distant configurations, the solver may fail to find a solution before hitting the cap. We do not guarantee every-case success.
  • Shortest Path: The path provided is guaranteed to be the shortest only if the goal is reached under unit-cost moves without hitting the search limits.
  • Playback Animation: Once a solution is generated, you can use the built-in animation controls to watch the tiles move one by one, helping you follow along with the exact optimal moves.

Use the tool to verify your manual solves, learn optimal maneuvers for specific tricky setups, or just watch the algorithm elegantly conquer the board!

Explore Free Tools

We provide free tools that primarily process data within your browser. Please note that some features require external communication. Before using a tool, check its individual page for details on data handling, feature availability, and usage limits.

Explore All Tools