This solution is outdated. To rescore this solution, sign in.
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))
|
2 | Pass |
%%
a = ...
[ 1 0 0
0 0 2];
tf_correct = true;
assert(isequal(knights_tour(a),tf_correct))
|
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 | 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))
|
Return the 3n+1 sequence for n
5206 Solvers
2516 Solvers
927 Solvers
144 Solvers
168 Solvers