Binary, Hanoi, and Sierpinski, part 2
3Blue1Brown · 13:40
Counting in binary solves the Towers of Hanoi puzzle optimally: each time you increment a binary counter, the number of bits that flip tells you which disk to move, and the disk always moves to the next peg on the rig...