Cody

# Problem 96. Knight's Tour Checker

Solution 2114978

Submitted on 2 Feb 2020 by Georg Balke
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))

out = logical 1 c = 1 r = 2 c = 3 r = 3 c = 2 r = 1 c = 1 r = 3 c = 3 r = 2 c = 1 r = 1 c = 2 r = 3

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

out = logical 1 c = 2 r = 3

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))

out = logical 1 c = 2 r = 2 c = 1 r = 4 c = 3 r = 3 c = 1 r = 2 c = 2 r = 4 c = 4 r = 3 c = 3 r = 1 c = 2 r = 3 c = 4 r = 4 c = 3 r = 2 c = 1 r = 3 c = 3 r = 4 c = 4 r = 2 c = 1 r = 1

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))

out = logical 1 c = 2 r = 2 c = 1 r = 4 c = 3 r = 3 c = 1 r = 2 c = 2 r = 4 c = 4 r = 3 c = 3 r = 1 c = 2 r = 3 c = 4 r = 4 c = 3 r = 2 c = 1 r = 3 c = 3 r = 4 c = 4 r = 2 c = 2 r = 1

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))

out = logical 1 c = 4 r = 2 c = 2 r = 1 c = 1 r = 3 c = 2 r = 5 c = 4 r = 6 c = 6 r = 5 c = 5 r = 3 c = 4 r = 1 c = 6 r = 2 c = 5 r = 4 c = 6 r = 6 c = 4 r = 5 c = 2 r = 6 c = 3 r = 4 c = 1 r = 5 c = 3 r = 6 c = 5 r = 5 c = 6 r = 3 c = 5 r = 1 c = 3 r = 2 c = 1 r = 1 c = 2 r = 3 c = 4 r = 4 c = 5 r = 6 c = 6 r = 4 c = 5 r = 2 c = 3 r = 1 c = 1 r = 2 c = 3 r = 3 c = 1 r = 4 c = 2 r = 2 c = 4 r = 3 c = 2 r = 4 c = 1 r = 6 c = 3 r = 5

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))

out = logical 1 c = 4 r = 1 c = 2 r = 1 c = 1 r = 3 c = 2 r = 5 c = 4 r = 6 c = 6 r = 5 c = 5 r = 3 c = 4 r = 2 c = 6 r = 2 c = 5 r = 4 c = 6 r = 6 c = 4 r = 5 c = 2 r = 6 c = 3 r = 4 c = 1 r = 5 c = 3 r = 6 c = 5 r = 5 c = 6 r = 3 c = 5 r = 1 c = 3 r = 2 c = 1 r = 1 c = 2 r = 3 c = 4 r = 4 c = 5 r = 6 c = 6 r = 4 c = 5 r = 2 c = 3 r = 1 c = 1 r = 2 c = 3 r = 3 c = 1 r = 4 c = 2 r = 2 c = 4 r = 3 c = 2 r = 4 c = 1 r = 6

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

out = logical 1 c = 3 r = 1