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
-
Arrange Vector in descending order
7996 Solvers
-
Back to basics 17 - white space
266 Solvers
-
The Answer to Life, the Universe, and Everything
477 Solvers
-
315 Solvers
-
297 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!