Binary, Hanoi and Sierpinski, part 1
3Blue1Brown · 13:58
Grant Sanderson (3Blue1Brown) shows that counting in binary *is* the optimal Towers of Hanoi solution: each time you flip the last bit you move disk 0 one peg to the right, and each time counting rolls over *k* places...