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 Solvers275
Suggested Problems
-
160 Solvers
-
Number of 1s in the Binary Representation of a Number
386 Solvers
-
Return elements unique to either input
651 Solvers
-
Given a window, how many subsets of a vector sum positive
818 Solvers
-
428 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!