Sliding Block Puzzles: From Huarong Dao to Rush Hour

Sliding Block Puzzles: From Huarong Dao to Rush Hour

Quick answer: a sliding block puzzle has pieces confined to a tray that can only slide, never be lifted out. The modern classic is Rush Hour, invented by Nob Yoshigahara in the 1970s as a wooden puzzle called Tokyo Parking. Sliding block puzzles are formally PSPACE-complete, which makes them harder than most puzzles that look far more complicated.

Best for: people who like planning several moves ahead and do not need anything concealed from them.

Every piece is visible. Every legal move is obvious. You can see the goal from the start, and there is nothing to discover at any point.

They remain brutally difficult, and unlike most puzzles that is provable rather than a matter of opinion.

What Is a Sliding Block Puzzle?

Pieces in a frame, movable only by sliding into free space, with the goal of getting one particular piece to a particular place or reaching a target arrangement.

Two things define the form. Pieces cannot be lifted, so every rearrangement has to be routed through gaps. And the free space is almost always tiny, often a single cell, which means progress depends entirely on manoeuvring the hole rather than the pieces.

It belongs to the combination family, sometimes called sequential movement, described in the guide to mechanical puzzles. The 15 puzzle is the most famous member.

Where Did Sliding Block Puzzles Come From?

Two lineages that met in the twentieth century.

The Chinese one is Huarong Dao, one of China's four classic puzzles alongside the Luban lock, the nine linked rings and the tangram. It is a block-escape puzzle built around a story from the Three Kingdoms, where a large piece has to be worked to an opening past smaller ones.

The Western one is the 15 puzzle, which caused a mania in the 1880s and was, as covered in its own article, not invented by the man who spent twenty years claiming it.

Who Invented Rush Hour?

Nob Yoshigahara, in the 1970s, and the name will be familiar for another reason.

Nobuyuki Yoshigahara, universally called Nob, was a Japanese puzzle inventor, collector and writer who died in 2004. The Nob Yoshigahara Puzzle Design Competition, held annually at the International Puzzle Party and the closest thing this field has to a formal honour, is named after him. We mention it constantly, in the profiles of Yasuhiro Hashimoto and Goh Pit Khiam among others.

His design began as a wooden puzzle called Tokyo Parking, was taken up by Binary Arts, now ThinkFun, and first sold in the United States in 1996.

So the man whose name sits on the competition that rates the hardest puzzles in the world also made the one that ended up in millions of family homes. That is a rarer combination than it sounds.

Why Are They Mathematically Hard?

Because they are PSPACE-complete, a result proved by Robert Hearn and Erik Demaine.

That is a stronger statement than NP-hard, which covers packing problems. Informally, NP-hard problems have solutions that are easy to check once found. PSPACE-complete problems can require solutions so long that merely writing one down is the difficulty.

The result holds even when every piece is a simple domino and all you want is to move one particular block. Which means a sliding block puzzle can be devastating with a handful of identical rectangles and no cleverness in the design at all.

Why Do They Suit Children and Defeat Adults?

Because nothing about them requires knowledge, and everything about them punishes impatience.

A sliding block puzzle needs no reading, no vocabulary and no prior experience. A child can be handed one and start immediately, which is why they sell so well as family games and why Rush Hour sits in classrooms.

What they require is the willingness to make a move that looks like going backwards. Adults are considerably worse at this than children, because adults arrive with a strategy, and the strategy is usually "get the target piece closer to the exit". That approach fails on almost every puzzle beyond the easiest level, and the people who abandon it fastest tend to be the ones who never formed it.

How Do You Solve a Sliding Block Puzzle?

By thinking about the empty space, not the pieces.

Track the hole. Nothing moves unless the gap is adjacent to it, so the real question on every turn is where the gap needs to be next. Experienced solvers plan routes for the empty cell.

Identify the blocker. In most puzzles one piece is genuinely in the way and everything else is noise. Work out which, and the puzzle becomes the much smaller problem of how to displace that one thing.

Do not solve greedily. Moving the target piece closer to the exit on every turn is the instinct and it is usually wrong. These puzzles almost always require moving away from the goal to open a route.

Accept the long way round. Solutions commonly take dozens of moves for a handful of pieces. If you are hunting a short answer you will reject the correct line.

Do We Make Any?

No, and this is the one major family we have nothing in. Sliding puzzles need a tray and captive pieces, which is a different kind of object from the interlocking and packing puzzles we print.

If the appeal is sequencing rather than sliding, the closest is Snake Cube, where 27 blocks on a cord can only be wrong in their order, with a full walkthrough. If it is the exact-move-count flavour, Tower of Hanoi is the other great sequence classic and we do make that one.

The wider range is in mechanical puzzles.

The best-known member of the family is Huarong Dao, whose classic layout needs a minimum of 81 moves.

For a puzzle that is half sliding and half rotation, see the Missing Link.

Frequently Asked Questions

What is a sliding block puzzle?

Pieces held in a frame that can only slide into adjacent free space and never be lifted out. The goal is usually to move one particular piece to a target position. The 15 puzzle and Rush Hour are the best-known examples.

Who invented Rush Hour?

Nob Yoshigahara, in the 1970s, originally as a wooden puzzle called Tokyo Parking. It was published by Binary Arts, now ThinkFun, and first sold in the United States in 1996. The Nob Yoshigahara Puzzle Design Competition is named after him.

Why are sliding block puzzles so hard?

They are PSPACE-complete, proved by Robert Hearn and Erik Demaine, which is formally harder than the NP-hard packing problems. It holds even when every piece is a simple domino, so a handful of plain rectangles can produce an extremely difficult puzzle.

What is Huarong Dao?

A traditional Chinese sliding block puzzle and one of the country's four classic puzzles, in which a large block must be worked to an opening past smaller ones. It is the ancestor of the modern sliding block form.

What is the trick to sliding block puzzles?

Plan routes for the empty space rather than for the pieces, since nothing can move unless the gap is next to it. Then find the single piece genuinely blocking the goal. Expect to move the target piece away from the exit at some point, which is the move most people refuse to make.

Back to blog