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 Solvers269
Suggested Problems
-
1629 Solvers
-
261 Solvers
-
Check if number exists in vector
7257 Solvers
-
07 - Common functions and indexing 6
386 Solvers
-
299 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!