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
-
How long is the longest prime diagonal?
366 Solvers
-
Determine the number of odd integers in a vector
536 Solvers
-
Sum the 'edge' values of a matrix
285 Solvers
-
299 Solvers
-
2509 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!