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
-
Count from 0 to N^M in base N.
225 Solvers
-
254 Solvers
-
Getting the indices from a matrix
479 Solvers
-
1006 Solvers
-
Create matrix of replicated elements
344 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!