Problem 186. The Tower of Hanoi
Solution Stats
Problem Comments
Solution Comments
-
1 Comment
Jan-Andrea Bard
on 4 Nov 2021
Ha, ha, so funny, after writing a function with a neat recursive moveNDisks function, realize that the number of moves is 2^n-1.
Problem Recent Solvers276
Suggested Problems
-
2007 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
1103 Solvers
-
559 Solvers
-
Create a two dimensional zero matrix
412 Solvers
-
2539 Solvers
More from this Author3
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!