Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [1 1 0
0 0 0
0 0 0];
y_correct = 0;
assert(isequal(isLegalTicTacToeState(x),y_correct))
y =
logical
0
|
2 | Pass |
x = [0 0 0
0 0 0
0 0 0];
y_correct = 1;
assert(isequal(isLegalTicTacToeState(x),y_correct))
y =
logical
0
|
3 | Pass |
x = [ -1 1 1
1 -1 -1
1 -1 -1];
y_correct = 0;
assert(isequal(isLegalTicTacToeState(x),y_correct))
y =
logical
0
|
4 | Pass |
x = [ 0 -1 1
-1 1 0
1 0 0];
y_correct = 1;
assert(isequal(isLegalTicTacToeState(x),y_correct))
y =
logical
0
|
5 | Pass |
x = [ 1 1 1
-1 -1 -1
0 0 0];
y_correct = 0;
assert(isequal(isLegalTicTacToeState(x),y_correct))
y =
logical
0
|
6 | Pass |
x = [-1 1 1
0 -1 1
1 0 -1];
y_correct = 0;
assert(isequal(isLegalTicTacToeState(x),y_correct))
y =
logical
0
|
7 | Pass |
x = [-1 1 0
0 0 0
0 0 0];
y_correct = 1;
assert(isequal(isLegalTicTacToeState(x),y_correct))
y =
logical
0
|
8 | Pass |
x = [-1 0 0
0 0 0
0 0 0];
y_correct = 0;
assert(isequal(isLegalTicTacToeState(x),y_correct))
y =
logical
0
|
9 | Pass |
x = [-1 1 0
0 1 0
0 1 0];
y_correct = 0;
assert(isequal(isLegalTicTacToeState(x),y_correct))
y =
logical
0
|
10 | Pass |
x = [1 1 1
-1 1 -1
-1 1 -1];
y_correct = 1;
assert(isequal(isLegalTicTacToeState(x),y_correct))
y =
logical
0
|
Find the stride of the longest skip sequence
105 Solvers
516 Solvers
401 Solvers
Back to basics 23 - Triangular matrix
634 Solvers
208 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!