Problem 186. The Tower of Hanoi
66.95% Correct | 33.05% Incorrect
Last Solution submitted on Mar 11, 2023
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
Swap the first and last columns
First non-zero element in each column
Flag largest magnitude swings as they occur
Generate N equally spaced intervals between -L and L
More from this Author3
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!