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 Solvers285
Suggested Problems
-
462 Solvers
-
Switch matrix to a column vector
319 Solvers
-
Convert given decimal number to binary number.
1482 Solvers
-
345 Solvers
-
Find the Oldest Person in a Room
12428 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!