HackerTube

I Solved Klotski

2swap3 HN recommenders · 2025–2026
2.1M views · explainer · evergreen · Uploaded 2025-08-22

2swap explains how he solved the Klotski sliding-block puzzle by mapping its full state space as a graph and visualizing it. The video includes footage of the Guinness world-record solve and links to an interactive graph.

HN people point to it for intuition about why some games are hard to navigate and for its Rush Hour and graph visualizations.

Chess, board games & puzzlesAlgorithms & data structuresData visualization & information design

Watch on YouTube

4 comments from Hacker News

@chii2025 · in “What Is Complexity in Chess?”

This reminds me of this nice video : [VIDEO] basically, the state space of the game can produce some intuition on why certain games are hard, and is demonstrated as a clustering of various states that are only linked to the winning state by a very small number of edges. So a player can easily "get lost" in the maze.

RecommendsView on HN
@dzaima2025 · in “Klotski”

This is an interactive accompaniment to a video that contains more information: [VIDEO] (previously discussed a bit at [LINK] )

CitesView on HN
@ohc2025 · in “Solving Rush Hour, the Puzzle (2018)”

Great article, very impressive to solve the entire game, rather than just individual puzzles. PS: Good chance that if you're reading these comments that you will appreciate this video by 2swap, visualising solutions to Rush Hour in 3D: [VIDEO]

RecommendsView on HN
@sublinear2026 · in “Like Game-of-Life, but on Growing Graphs, with WASM and WebGL”

This looks similar to the graphs on "2swap"[1]. Worth a watch if you haven't by now. [1] [VIDEO]

RecommendsView on HN