Cody

# Problem 199. hanoi towers II

Solution 105455

Submitted on 2 Jul 2012 by James
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))

mytry = 2

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

mytry = 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]))

{Warning: Size vector should be a row vector with integer elements.} {> In repmat at 91 In unHanoingProblem at 5 In verifyCode>evaluateCode at 189 In verifyCode at 37 In fevalJSON at 14} mytry = Columns 1 through 10 3 2 1 3 2 1 3 2 1 3 Columns 11 through 20 2 1 3 2 1 3 2 1 3 2 Columns 21 through 30 1 3 2 1 3 2 1 3 2 1 Columns 31 through 40 3 2 1 3 2 1 3 2 1 3 Columns 41 through 50 2 1 3 2 1 3 2 1 3 2 Columns 51 through 60 1 3 2 1 3 2 1 3 2 1 Columns 61 through 63 3 2 1