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 Solvers276
Suggested Problems
-
Find state names that end with the letter A
935 Solvers
-
950 Solvers
-
469 Solvers
-
Generate a random matrix A of (1,-1)
235 Solvers
-
430 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!