Are all boards solvable?

Random shuffles aren't always solvable — only half of all 16!/2 possible arrangements are reachable from solved. We generate boards by starting solved and doing random valid moves, which guarantees solvability. If your board feels stuck, the issue is strategy, not solvability.

Why are only half of all arrangements solvable?

Permutation parity. Each tile slide is mathematically a transposition (swap of two adjacent positions). The parity of a permutation alternates with each transposition. A reachable arrangement must satisfy a parity condition involving the empty cell's row distance from its solved position. The proof is in any introductory abstract-algebra textbook under 'symmetric group'.

In 1880 American puzzle-maker Sam Loyd offered a $1,000 prize (~$30,000 in 2026 money) for solving a 15-puzzle with the 14 and 15 swapped — which mathematicians had just proven unsolvable. The prize generated huge publicity and fueled the 1880-81 viral craze, but no one ever claimed the money because no one could solve an unsolvable puzzle.

What's the most efficient solve?

Optimal solve length depends on the start state — God's number (the maximum number of moves needed to solve any 15-puzzle position) is 80. Most random scrambles solve in 30-60 moves with good strategy. Casual players use 100-200 moves, which is fine; speed-solvers using carefully memorized algorithms approach the 30-60 optimal range.

Are there bigger or smaller versions?

8-puzzle (3×3 grid, 8 tiles + empty) is a common smaller variant — easier and faster. 24-puzzle (5×5) and 35-puzzle (6×6) are larger. Beyond that, the optimal-solver complexity grows; 24-puzzle was solved by computer search in 2007 (God's number = 152). Larger versions remain open problems.

Why is the 15-puzzle considered the first viral puzzle?

Because it spread globally in early 1880 with no internet — newspapers, magazines, and street-corner discussions carried the craze. Loyd's $1,000 prize accelerated it. The 15-puzzle became the cultural reference point for 'sliding tile puzzle' in a way no earlier puzzle had achieved.

Games · Free tool

15 Puzzle

Classic 15-puzzle slider. Arrange tiles 1-15 in order. Every shuffle is solvable.

Updated June 2026

Moves

Time

0:00

Slide tiles into the empty space to arrange 1-15 in order. Click a tile adjacent to the empty space to slide it. Average solve: 50-100 moves; god-tier speedrunners hit 60-80 in under a minute.

Found this useful?Email Buy Me a Coffee

What it does

The classic 15-puzzle: a 4×4 grid with 15 numbered tiles and one empty space. Slide tiles into the empty space to rearrange them into order 1-15 with the empty in the bottom-right. Tracks your move count and elapsed time; best stats persist in your browser. Every random board this generator produces is guaranteed solvable.

The 15-puzzle has a remarkable mathematical history. Invented around 1880, it became the world’s first viral puzzle craze in 1880-1881 thanks to a famous (apocryphal) prize of $1,000 offered by puzzle-maker Sam Loyd for solving an explicitly-impossible variant. Over the next decade mathematicians proved that only half of the 16!/2 ≈ 10.5 trillion possible arrangements are reachable from the solved state. The other half — including Loyd’s prize- puzzle — are unsolvable, no matter how cleverly you slide.

The proof uses permutation parity: each tile slide is a swap with the empty space, alternating the parity of the tile arrangement’s permutation. A solvable board must have even parity counted with the row distance of the empty cell. This generator produces guaranteed-solvable boards by starting from the solved state and applying random valid moves — a clean construction that sidesteps the parity issue entirely.

Embed this tool on your siteShow snippet

Paste this snippet into any page. Loads on-demand (lazy), no tracking scripts, and sized to most dashboards. Replace the height to fit your layout.

<iframe src="https://freetoolarena.com/embed/15-puzzle" width="100%" height="720" frameborder="0" loading="lazy" title="15 Puzzle" style="border:1px solid #e2e8f0;border-radius:12px;max-width:720px;"></iframe>

Embed docs →

How to use it

Click any tile that's adjacent to the empty space — it slides into the empty space and the empty moves to where the tile was.
Goal: tiles 1-15 in order across the rows, empty in the bottom-right corner.
Move counter and timer track your performance. Best stats save automatically.
Click 'New Game' to scramble. The shuffle is generated by random valid moves from solved, so the result is guaranteed reachable.
Strategy tip: solve the top row first (1, 2, 3, 4), then row 2 (5, 6, 7, 8), then bottom 2 rows together. Never disturb already-solved rows.

When to use this tool

5-15 minute focused puzzle break (typical solve takes 5-15 minutes for casual players).
Demonstrating permutation parity in math/CS education.
Practicing systematic problem-solving — the 15-puzzle teaches you to break a hard problem into solvable subproblems.
Casual competitive play — race to solve the same starting board.

When not to use it

When you want a long game — 15-puzzle takes 10-20 minutes typically. Pick a smaller variant (8-puzzle, 4 tiles + empty) for a quicker version.
Multiplayer — the 15-puzzle is solo. Compete by sharing scrambles and racing.
If you find sliding-tile puzzles frustrating — some people genuinely don't enjoy them and that's fine.

Common use cases

Pre-decision sanity-check on inputs and outputs
Educational use — demonstrating the underlying concept
Onboarding a colleague who needs the same calculation/conversion
Verifying a number or output before passing it on

Frequently asked questions

Are all boards solvable?: Random shuffles aren't always solvable — only half of all 16!/2 possible arrangements are reachable from solved. We generate boards by starting solved and doing random valid moves, which guarantees solvability. If your board feels stuck, the issue is strategy, not solvability.
Why are only half of all arrangements solvable?: Permutation parity. Each tile slide is mathematically a transposition (swap of two adjacent positions). The parity of a permutation alternates with each transposition. A reachable arrangement must satisfy a parity condition involving the empty cell's row distance from its solved position. The proof is in any introductory abstract-algebra textbook under 'symmetric group'.
Sam Loyd's prize?: In 1880 American puzzle-maker Sam Loyd offered a $1,000 prize (~$30,000 in 2026 money) for solving a 15-puzzle with the 14 and 15 swapped — which mathematicians had just proven unsolvable. The prize generated huge publicity and fueled the 1880-81 viral craze, but no one ever claimed the money because no one could solve an unsolvable puzzle.
What's the most efficient solve?: Optimal solve length depends on the start state — God's number (the maximum number of moves needed to solve any 15-puzzle position) is 80. Most random scrambles solve in 30-60 moves with good strategy. Casual players use 100-200 moves, which is fine; speed-solvers using carefully memorized algorithms approach the 30-60 optimal range.
Are there bigger or smaller versions?: 8-puzzle (3×3 grid, 8 tiles + empty) is a common smaller variant — easier and faster. 24-puzzle (5×5) and 35-puzzle (6×6) are larger. Beyond that, the optimal-solver complexity grows; 24-puzzle was solved by computer search in 2007 (God's number = 152). Larger versions remain open problems.
Why is the 15-puzzle considered the first viral puzzle?: Because it spread globally in early 1880 with no internet — newspapers, magazines, and street-corner discussions carried the craze. Loyd's $1,000 prize accelerated it. The 15-puzzle became the cultural reference point for 'sliding tile puzzle' in a way no earlier puzzle had achieved.

Explore more games tools

100% in-browserNo downloadsNo sign-upMalware-freeHow we keep this safe →