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 Solvers271
Suggested Problems
-
2569 Solvers
-
Create a cell array out of a struct
972 Solvers
-
143 Solvers
-
203 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
433 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!