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
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 ^^'
Make the vector [1 2 3 4 5 6 7 8 9 10]
29427 Solvers
Renaming a field in a structure array
542 Solvers
1594 Solvers
357 Solvers
165 Solvers