Cody

Problem 199. hanoi towers II

Solution 3917488

Submitted on 30 Nov 2020 by Danuanping
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
n = 1; y_correct = [2]; assert(isequal(unHanoingProblem(n),y_correct))

ans = 2

2   Pass
n = 3; y_correct = [1 3 3 7]; assert(isequal(unHanoingProblem(3),[2 3 1 2 3 1 2]))

ans = 2 3 1 2 3 1 2

3   Pass
n = 6; y_correct = [2 3 1 2 3 1 2]; assert(isequal(unHanoingProblem(n),[3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1]))

ans = Columns 1 through 29 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 Columns 30 through 58 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 Columns 59 through 63 2 1 3 2 1

Suggested Problems

More from this Author3

Community Treasure Hunt

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

Start Hunting!