Cody

Problem 96. Knight's Tour Checker

Solution 1421532

Submitted on 21 Jan 2018 by Daniel Rubin
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
a = ... [ 7 2 5 4 0 8 1 6 3]; tf_correct = true; assert(isequal(knights_tour(a),tf_correct))

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

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

4 1 2 2 1 4 3 3 1 2 2 4 4 3 3 1 2 3 4 4 3 2 1 3 3 4 4 2 1 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))

4 1 2 2 1 4 3 3 1 2 2 4 4 3 3 1 2 3 4 4 3 2 1 3 3 4 4 2 2 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))

6 1 4 2 2 1 1 3 2 5 4 6 6 5 5 3 4 1 6 2 5 4 6 6 4 5 2 6 3 4 1 5 3 6 5 5 6 3 5 1 3 2 1 1 2 3 4 4 5 6 6 4 5 2 3 1 1 2 3 3 1 4 2 2 4 3 2 4 1 6 3 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))

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

1 1 3 1

Suggested Problems

More from this Author95

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!