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 Solvers285
Suggested Problems
-
Get the area codes from a list of phone numbers
899 Solvers
-
Back to basics 22 - Rotate a matrix
860 Solvers
-
Flag largest magnitude swings as they occur
649 Solvers
-
Generate a vector like 1,2,2,3,3,3,4,4,4,4
7915 Solvers
-
411 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!