I Solved Klotski
2swap3 HN recommenders · recommended in 3 months, 2025-2026
2.1M views · 1 year ago · 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.
14:28Superpositions, Sudoku, the Wave Function Collapse algorithm.
Martin Donald
764K views • 6 years ago
5:5015 Sorting Algorithms in 6 Minutes
Timo Bingmann
29.4M views • 13 years ago
25:39H3: Tiling the Earth with Hexagons
Uber Engineering
53K views • 8 years ago
1:11Infinite Mario AI - Long Level
Robin Baumgarten
1.3M views • 17 years ago
51:47Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths
MIT OpenCourseWare
2.9M views • 13 years ago
![[JSConfUS 2013] Steven Wittens: Making WebGL Dance](https://i.ytimg.com/vi/GNO_CYUjMK8/hq2.jpg)
30:55[JSConfUS 2013] Steven Wittens: Making WebGL Dance
JSConf
56K views • 13 years ago
9:43A Sudoku Solver in APL
Dyalog
47K views • 14 years ago
35:16Bret Victor - Drawing Dynamic Visualizations
Colin McDonnell
17K views • 11 years ago
57:03HACKENBUSH: a window to a new world of math
Owen Maitzen
562K views • 5 years ago
39:15The Maximal Graph - Wilker Silva
ClojureTV
8K views • 6 years ago
5:58MarI/O - Machine Learning for Video Games
SethBling
11.5M views • 11 years ago
32:32The Strange Math That Predicts (Almost) Anything
Veritasium
13.1M views • 1 year ago
54:15Google I/O 2011: Java Puzzlers - Scraping the Bottom of the Barrel
Google for Developers
60K views • 15 years ago
1:10:10CRDTs: The Hard Parts
Martin Kleppmann
90K views • 6 years ago
55:10Visualizing Data Using t-SNE
Google TechTalks
204K views • 13 years ago
1:07:02Stanford Lecture: Don Knuth—"A Conjecture That Had To Be True" (2017)
Stanford Online
30K views • 8 years ago
46:22"Clojure in Unity 3D: Functional Video Game Development" by Ramsey Nasser and Tims Gardner
Strange Loop Conference
24K views • 12 years ago
14:27A simple trick to design your own solutions for Rubik's cubes
Mathologer
1.6M views • 10 years ago
42:31"Datafun: a functional query language" by Michael Arntzenius
Strange Loop Conference
9K views • 9 years ago
1:03:22REcon 2013 - The Future of RE : Dynamic Binary Visualization (Christopher Domas)
Sébastien Duquette
9K views • 12 years ago
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 is an interactive accompaniment to a video that contains more information: ▶ this video (previously discussed a bit at link )
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.