Key to the Tower of Hanoi - Numberphile

Binary, Hanoi and Sierpinski, part 1

The ultimate tower of Hanoi algorithm

The Math of Being a Greedy Pig - Numberphile

Tower of Hanoi, 8 disks. Only 255 moves requires to solve it.

Towers of Hanoi: A Complete Recursive Visualization

Mathematics is all about SHORTCUTS - Numberphile

The Clever Way to Count Tanks - Numberphile

The Tower of Hanoi (Recursive Formula and Proof by Induction)

The Plotting of Beautiful Curves (Euler Spirals and Sierpiński Triangles) - Numberphile

A New Tile in Newtyle - Numberphile

[102] How to solve the Towers of Hanoi

RIT Imaging Science Alumni Talk: Juliet Fiss

The Doomsday Algorithm - Numberphile

Tower of Hanoi (extra) - Numberphile

Easy Solution to the Tower of Hanoi, Hack Hanoi

Way Bigger Than Graham's Number (Goodstein Sequence) - Numberphile

Fun Python Project. Recursion and the Towers of Hanoi

The Langlands Program - Numberphile

Solving 37-disc Hanoi Tower stack puzzle! (4358 Years @ 1 Move/Second)