Cody

Problem 96. Knight's Tour Checker

Solution 1608833

Submitted on 14 Aug 2018 by Daniel Yago
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))

I = 3 1 3 2 1 3 1 2 J = 1 2 3 1 3 2 1 3 ans = logical 1

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

I = 1 2 J = 1 3 ans = logical 1

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

I = 4 2 1 3 1 2 4 3 2 4 3 1 3 4 1 J = 1 2 4 3 2 4 3 1 3 4 2 3 4 2 1 ans = 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))

I = 4 2 1 3 1 2 4 3 2 4 3 1 3 4 2 J = 1 2 4 3 2 4 3 1 3 4 2 3 4 2 1 ans = logical 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))

I = 6 4 2 1 2 4 6 5 4 6 5 6 4 2 3 1 3 5 6 5 3 1 2 4 5 6 5 3 1 3 1 2 4 2 1 3 J = 1 2 1 3 5 6 5 3 1 2 4 6 5 6 4 5 6 5 3 1 2 1 3 4 6 4 2 1 2 3 4 2 3 4 6 5 ans = logical 1

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

I = 6 4 2 1 2 4 6 5 4 6 5 6 4 2 3 1 3 5 6 5 3 1 2 4 5 6 5 3 1 3 1 2 4 2 1 J = 1 1 1 3 5 6 5 3 2 2 4 6 5 6 4 5 6 5 3 1 2 1 3 4 6 4 2 1 2 3 4 2 3 4 6 ans = logical 0

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

I = 1 3 J = 1 1 ans = logical 0