Lights Out is a logic game wherein all lights need to be turned off to complete each board. See the first problem in the series for an introduction.
This problem contains boards that each require six moves to solve. However, now wrapping of the lights occurs. For example, if
board = [1 0 0 0 1
1 0 1 0 1
0 0 0 0 0
1 0 1 0 1
1 0 0 0 1]the answer is:
moves = [1 5 11 15 21 25]
Prev.: 5x5, light-only solution? II — Next: 5x5, wrapping, x moves
Solution Stats
Problem Comments
4 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers15
Suggested Problems
-
2377 Solvers
-
320 Solvers
-
Return unique values without sorting
1025 Solvers
-
Remove the two elements next to NaN value
713 Solvers
-
Find third Side of a right triangle given hypotenuse and a side. No * - or other functions allowed
253 Solvers
More from this Author139
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
The first test suite problem is troublesome because it requires only 3 moves, and the 3-move solution is not necessarily the first one it finds that has 6 moves or less.
...also, how does the assert(numel(moves)==6) work on the problem that has only 3 moves?
@William: the troublesome test case has been removed. Thanks for pointing that out.
some cases admit shorter solution ^^'