Towers of Hanoi ↔ Binary Counting

Count from 0 to 2^n−1 in binary. The bit that flips to 1 tells you which disc to move. Disc k=0 (smallest) moves on every step — bit 0 always flips. Smallest disc is RED.

n discs
3
Speed
3 steps/sec
0 / 7 moves
Binary Counter
0
decimal
Towers of Hanoi — Pegs A, B, C
✓ Solved! All discs on peg C.
P1: n=3 requires exactly 7 moves to complete.
P2: Smallest disc (k=0) moves on every single step.