Problem 113. N-Queens Checker

Solution 1997635

Submitted on 31 Oct 2019 by Nicholas Betancourt

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test	Status	Code Input and Output
1	Pass	a = [1 0 0; 0 0 1; 0 0 0]; tf_correct = true; assert(isequal(queens(a),tf_correct))
2	Pass	a = [0 0 0 1; 1 0 0 0; 0 0 1 0; 0 1 0 0]; tf_correct = false; assert(isequal(queens(a),tf_correct))
3	Pass	a = [1 0 0 0 0; 0 0 0 1 1]; tf_correct = false; assert(isequal(queens(a),tf_correct))
4	Pass	a = [ ... 0 0 1 0 0 0 0 0; 0 0 0 0 0 0 1 0; 0 1 0 0 0 0 0 0; 0 0 0 0 0 0 0 1; 0 0 0 0 0 1 0 0; 0 0 0 1 0 0 0 0; 1 0 0 0 0 0 0 0; 0 0 0 0 1 0 0 0]; tf_correct = true; assert(isequal(queens(a),tf_correct))
5	Pass	a = ones(15,7); tf_correct = false; assert(isequal(queens(a),tf_correct))
6	Pass	a = zeros(20,23); a(1,22) = 1; a(2,23) = 1; tf_correct = false; assert(isequal(queens(a),tf_correct))
7	Pass	a = [1 0; 0 1]; tf_correct = false; assert(isequal(queens(a),tf_correct))
8	Pass	a = [1 0 1; 0 0 0; 0 1 0]; tf_correct = false; assert(isequal(queens(a),tf_correct))