Towers of Hanoi (3D)

About this app

The classic recursion puzzle in space: choose the number of disks, let the algorithm solve it optimally (2ⁿ−1 moves) or move them yourself — peg by peg the recursive idea T(n)=2·T(n−1)+1 becomes visible.

Subject: Computer science

More from Computer science

• Ackermann function
• Elevator simulator
• Binary workshop
• Binary versus linear search
• The Collatz problem
• Inside a CPU
• Function rooms in 3D
• Floating-point anatomy

A VisuApp by heyprof: interactive, free in your browser, no sign-up. What is a VisuApp? · All apps