I Solved Klotski
2swap3 HN recommenders · recommended in 3 months, 2025–2026
explainer · general · evergreen · 2025–2026 on HN
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.
Up next
9 mo on HNQuantum Entanglement & Spooky Action at a Distance
Veritasium
9 HN recommender · 2015–2022
4 mo on HNIs AI Safety a Pascal's Mugging?
Robert Miles AI Safety
3 HN recommender · 2019–2026
3 mo on HNThe Halo Drive
Cool Worlds
3 HN recommender · 2019–2023
8 mo on HNWealth Inequality in America
politizane
8 HN recommender · 2013–2025
5 mo on HNRenting vs. Buying a Home: The 5% Rule
Ben Felix
6 HN recommender · 2020–2026
3 mo on HNI tried using AI. It scared me.
Tom Scott
4 HN recommender · 2023–2025
5 mo on HNFeynman: How to think 1 of 2 FUN TO IMAGINE 11
Christopher Sykes
5 HN recommender · 2011–2024
3 mo on HNTUN: Un-Ruining the MMO
MrBtongue
2 HN recommender · 2016–2022
10 mo on HNAlphaGo - The Movie | Full award-winning documentary
Google DeepMind
10 HN recommender · 2020–2025
10 mo on HNComputer program that learns to play classic NES games
suckerpinch
9 HN recommender · 2015–2025
5 mo on HNThe Expert Myth
Veritasium
6 HN recommender · 2022–2026
6 mo on HN30 Weird Chess Algorithms: Elo World
suckerpinch
8 HN recommender · 2019–2026
4 comments from Hacker News
This looks similar to the graphs on "2swap"[1]. Worth a watch if you haven't by now. [1] ▶ this video
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: ▶ this video
This reminds me of this nice video : ▶ this 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.
This is an interactive accompaniment to a video that contains more information: ▶ this video (previously discussed a bit at link )