This looks similar to the graphs on "2swap"[1]. Worth a watch if you haven't by now. [1] ▶ this video
in “Like Game-of-Life, but on Growing Graphs, with WASM and WebGL” · View on HN
I Solved Klotski on HackerTube: recommended by 3 Hacker News commenters across 3 separate months, 2025–2026.
explainer · evergreen
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.
“the state space of the game can produce some intuition on why certain games are hard”
4 Hacker News comments link this video. Each one links back to its thread.
This looks similar to the graphs on "2swap"[1]. Worth a watch if you haven't by now. [1] ▶ this video
in “Like Game-of-Life, but on Growing Graphs, with WASM and WebGL” · View on HN
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
in “Solving Rush Hour, the Puzzle (2018)” · View on HN
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.
in “What Is Complexity in Chess?” · View on HN
This is an interactive accompaniment to a video that contains more information: ▶ this video (previously discussed a bit at [link] )
in “Klotski” · View on HN