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

"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 sliding block game, this frustration is universal. Randomly sliding tiles around almost never works.

However, solvable sliding tile puzzles can be completed by following a step-by-step method.

Once you know the strategy, you will never get stuck again—regardless of how scrambled the initial board is.

In this guide, we break down the classic 4-step sliding puzzle solution with clear visual diagrams.

§1. The Two Golden Rules of Slide Puzzles

Before jumping into the moves, keep these two fundamental rules in mind:

[Rule 1] Once a row or column is solved, NEVER break it.
[Rule 2] Reduce the puzzle's size step-by-step (Row by Row, Column by Column).

Beginners fail because they try to place all 15 numbers at the same time. The secret is to shrink the active board:

For a 4x4 (15-puzzle):

1. Solve Row 1 → You now only have a 3x4 puzzle left.

2. Solve Row 2 → You now only have a 2x4 puzzle left.

3. Solve the Left Column → You now only have a 2x3 puzzle left.

4. Rotate the final 2x2 square to finish!

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

Start with the top row from left to right:

[ 1 ][ 2 ][ 3 ][ 4 ]  <-- Target Row
[   ][   ][   ][   ]
[   ][   ][   ][   ]
[   ][   ][   ][   ]

Tiles 1 and 2: Easy to place. Simply guide them to their home positions using the open space below.
Tiles 3 and 4 (The Corner Technique):
If you place 3 in its spot, you won't have room to slide 4 in.
Solution: Place 3 where 4 belongs (top-right corner), and place 4 directly underneath it. Then, rotate them counter-clockwise together into positions 3 and 4!

Once Row 1 is complete, lock it down and do not touch it again.

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

Use the exact same strategy for the second row:

[ 1 ][ 2 ][ 3 ][ 4 ]  <-- Locked
[ 5 ][ 6 ][ 7 ][ 8 ]  <-- Target Row
[   ][   ][   ][   ]
[   ][   ][   ][   ]

Move 5 and 6 to their positions.
Use the Corner Technique for 7 and 8 (place 7 at the end, 8 below it, and rotate).

Now the top half of the puzzle (1 through 8) is fully solved!

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

This is where most people get stuck. Do NOT try to solve row 3 horizontally. Instead, solve the remaining 2x4 area as vertical columns from left to right.

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

How to pair 9 and 13:

1. Place 9 in the bottom-left slot (where 13 belongs).

2. Place 13 to its right.

3. Slide them clockwise so 9 moves up to row 3, and 13 moves into row 4.

Repeat this exact technique for 10 and 14.

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

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

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

Simply cycle the remaining three tiles clockwise or counter-clockwise until they fall into place. Your puzzle is solved!

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

If your entire puzzle is solved except for the last two tiles (e.g. 14 and 15 are swapped), the puzzle is mathematically impossible to solve.

In sliding tile mathematics (permutation parity), exactly 50% of random configurations are unsolvable.

If you physically popped tiles out and reinserted them randomly, half of all arrangements can never be solved without taking pieces out again.

§7. Explore a Solution with Our AI Solver

Want to see the optimal solution for your specific scramble?

Try our 15-Puzzle Optimal Solver & Simulator to search for a shortest solution and view its moves. The tool supports 3×3 and 4×4 boards and stops when the search limit is reached; it cannot solve every difficult position within that limit.