Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
board = [0 1 0 0 0
1 1 1 0 1
0 1 0 1 1
1 0 0 0 1
1 1 0 0 0];
moves = lights_out_1(board); %should be [5 7 23]
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),2); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
assert(numel(moves)==3)
|
2 | Fail |
board = [1 1 0 0 0
1 0 1 0 0
0 1 1 1 0
0 0 1 0 1
0 0 0 1 1];
moves = lights_out_1(board); %should be [1 13 25]
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),2); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
assert(numel(moves)==3)
|
3 | Pass |
board = [1 0 0 0 0
0 1 0 0 0
1 1 0 0 0
0 1 0 0 0
1 0 0 0 0];
moves = lights_out_1(board); %should be [2 3 4]
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),2); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
assert(numel(moves)==3)
|
4 | Pass |
board = [0 1 1 1 0
1 0 1 0 1
0 1 1 1 0
0 0 0 0 0
0 0 0 0 0];
moves = lights_out_1(board); %should be [7 12 17]
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),2); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
assert(numel(moves)==3)
|
5 | Fail |
board = [0 0 0 0 0
0 0 0 0 0
0 0 0 1 1
0 0 1 1 0
0 0 1 0 0];
moves = lights_out_1(board); %you're on your own now
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),2); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
assert(numel(moves)==3)
|
6 | Pass |
board = [0 0 0 0 0
0 0 0 0 0
0 1 0 1 0
1 1 1 1 1
0 0 1 0 0];
moves = lights_out_1(board);
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),2); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
assert(numel(moves)==3)
|
4597 Solvers
Create a matrix X, where each column is a shifted copy of the vector v
142 Solvers
Operate on matrices of unequal, yet similar, size
104 Solvers
531 Solvers
321 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!