Problem 186. The Tower of Hanoi

Difficulty:Rate

Solution 6828220

Submitted on 4 Nov 2021 by Jan-Andrea Bard

This solution is locked. To view this solution, you need to solve the problem first.

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.

Cecilia on 13 Jul 2023

Also nearly played myself writing a recursive solution haha

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!