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 Solvers284
Suggested Problems
-
2154 Solvers
-
Back to basics 16 - byte order
187 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
562 Solvers
-
Make a random, non-repeating vector.
6441 Solvers
-
Generate N equally spaced intervals between -L and L
797 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!