Cody

# Problem 96. Knight's Tour Checker

Solution 1370759

Submitted on 6 Dec 2017 by David Verrelli
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
a = ... [ 7 2 5 4 0 8 1 6 3]; tf_correct = true; assert(isequal(knights_tour(a),tf_correct))

oldR = 3 oldC = 1 found = logical 1 newR = 1 newC = 2 newR = 3 newC = 3 newR = 2 newC = 1 newR = 1 newC = 3 newR = 3 newC = 2 newR = 1 newC = 1 newR = 2 newC = 3 newR = 0×1 empty double column vector newC = 0×1 empty double column vector

2   Pass
a = ... [ 1 0 0 0 0 2]; tf_correct = true; assert(isequal(knights_tour(a),tf_correct))

oldR = 1 oldC = 1 found = logical 1 newR = 2 newC = 3 newR = 0×1 empty double column vector newC = 0×1 empty double column vector

3   Pass
a = ... [ 15 5 12 3 0 2 9 6 8 11 4 13 1 14 7 10]; tf_correct = false; assert(isequal(knights_tour(a),tf_correct))

oldR = 4 oldC = 1 found = logical 1 newR = 2 newC = 2 newR = 1 newC = 4 newR = 3 newC = 3 newR = 1 newC = 2 newR = 2 newC = 4 newR = 4 newC = 3 newR = 3 newC = 1 newR = 2 newC = 3 newR = 4 newC = 4 newR = 3 newC = 2 newR = 1 newC = 3 newR = 3 newC = 4 newR = 4 newC = 2 newR = 1 newC = 1 tf = logical 0

4   Pass
a = ... [ 0 5 12 3 15 2 9 6 8 11 4 13 1 14 7 10]; tf_correct = true; assert(isequal(knights_tour(a),tf_correct))

oldR = 4 oldC = 1 found = logical 1 newR = 2 newC = 2 newR = 1 newC = 4 newR = 3 newC = 3 newR = 1 newC = 2 newR = 2 newC = 4 newR = 4 newC = 3 newR = 3 newC = 1 newR = 2 newC = 3 newR = 4 newC = 4 newR = 3 newC = 2 newR = 1 newC = 3 newR = 3 newC = 4 newR = 4 newC = 2 newR = 2 newC = 1 newR = 0×1 empty double column vector newC = 0×1 empty double column vector

5   Pass
a = [22 29 4 31 16 35;3 32 23 34 5 14;28 21 30 15 36 17;9 2 33 24 13 6;20 27 8 11 18 25;1 10 19 26 7 12]; tf_correct = true; assert(isequal(knights_tour(a),tf_correct))

oldR = 6 oldC = 1 found = logical 1 newR = 4 newC = 2 newR = 2 newC = 1 newR = 1 newC = 3 newR = 2 newC = 5 newR = 4 newC = 6 newR = 6 newC = 5 newR = 5 newC = 3 newR = 4 newC = 1 newR = 6 newC = 2 newR = 5 newC = 4 newR = 6 newC = 6 newR = 4 newC = 5 newR = 2 newC = 6 newR = 3 newC = 4 newR = 1 newC = 5 newR = 3 newC = 6 newR = 5 newC = 5 newR = 6 newC = 3 newR = 5 newC = 1 newR = 3 newC = 2 newR = 1 newC = 1 newR = 2 newC = 3 newR = 4 newC = 4 newR = 5 newC = 6 newR = 6 newC = 4 newR = 5 newC = 2 newR = 3 newC = 1 newR = 1 newC = 2 newR = 3 newC = 3 newR = 1 newC = 4 newR = 2 newC = 2 newR = 4 newC = 3 newR = 2 newC = 4 newR = 1 newC = 6 newR = 3 newC = 5 newR = 0×1 empty double column vector newC = 0×1 empty double column vector

6   Pass
a = [22 29 4 31 16 35;3 32 23 34 5 14;28 21 30 15 0 17;2 9 33 24 13 6;20 27 8 11 18 25;1 10 19 26 7 12]; tf_correct = false; assert(isequal(knights_tour(a),tf_correct))

oldR = 6 oldC = 1 found = logical 1 newR = 4 newC = 1 tf = logical 0

7   Pass
a = [1 0 0;0 0 0;2 0 0]; tf_correct = false; assert(isequal(knights_tour(a),tf_correct))

oldR = 1 oldC = 1 found = logical 1 newR = 3 newC = 1 tf = logical 0