🔒 Pro members only
Towers of Hanoi
Apply recursion to solve the Towers of Hanoi, a classic mathematical puzzle of how to stack disks of different sizes.
This lesson is part of the members-only content of Computer science theory. The first 3 lessons of every course are free — this one starts after the free preview.
- ✓ Unlimited access to every lesson, video and article
- ✓ All subjects and age groups in one membership
- ✓ Cancel anytime · Visa & MasterCard accepted