Cody

Problem 199. hanoi towers II

Solution 2006875

Submitted on 7 Nov 2019 by cokakola
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
n = 1; y_correct = [2]; assert(isequal(unHanoingProblem(n),y_correct))
2   Pass
n = 3; y_correct = [1 3 3 7]; assert(isequal(unHanoingProblem(3),[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]))

Suggested Problems

More from this Author3