Simple rules, hidden order: 5 algorithms you can watch think

Five puzzles, five algorithms, every step computed and shown. A chess knight visits all 64 squares exactly once using a single rule from 1823, and its tour even closes into a loop. Backtracking places eight queens on a chessboard with no attacks, then finds all 92 solutions. Recursion solves the Tower of Hanoi in 255 moves, and the moves turn out to be counting in binary. A random explorer carves a perfect maze, and a patient flood finds the only way out. And Langton's ant follows two rules into ten thousand steps of chaos, until it suddenly builds a highway. Chapters 0:00 The knight's tour 0:56 Eight queens 1:48 The Tower of Hanoi 2:41 A maze that solves itself 3:33 Langton's ant More tools and explainers: https://apexapro.com/ Sources: H. C. von Warnsdorff (1823); B. D. McKay, ANU TR-CS-97-03 (1997); Wikipedia, "Eight queens puzzle", "Tower of Hanoi", "Langton's ant"; C. Langton, Physica D 22 (1986). Music, sound effects and narration generated with ElevenLabs. #algorithms #math #chess #satisfying #coding #puzzles #emergence #computerscience