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 Solvers287
Suggested Problems
-
1277 Solvers
-
Increment a number, given its digits
614 Solvers
-
Flip the main diagonal of a matrix
625 Solvers
-
Sum of first n terms of a harmonic progression
363 Solvers
-
162 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!