Neural Ninjas · DSA Simulation Labs · Lab 43

🗼 The Tower of Hanoi

Move every disk from peg A to peg C, one at a time, never placing a bigger disk on a smaller one. The optimal solution always breaks the problem into two smaller identical problems — that recursive shape is the entire secret.

Move Log

Controls

💿 DiskI only ever move alone, one at a time. Once I'm lifted, I always land on an empty peg or on top of a strictly bigger disk — never on a smaller one.
📐 The Recursive TrickTo move N disks, first move the top N-1 out of the way, move the biggest disk, then bring those N-1 back on top. Same problem, one size smaller, twice.
Pick a level above to begin.