Problem 186. The Tower of Hanoi
Solution Stats
Problem Comments
Solution Comments
-
1 Comment
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 Solvers268
Suggested Problems
-
Find the peak 3n+1 sequence value
1537 Solvers
-
210 Solvers
-
Back to basics 9 - Indexed References
407 Solvers
-
Change the sign of even index entries of the reversed vector
376 Solvers
-
Magic is simple (for beginners)
5212 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!