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 Solvers280
Suggested Problems
-
4297 Solvers
-
How to find the position of an element in a vector without using the find function
2573 Solvers
-
370 Solvers
-
309 Solvers
-
Back to basics 16 - byte order
177 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!