Problem 44764. Lights Out 10 - 5x5, with wrapping, 6 moves
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
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 ^^'
Solution Comments
Show commentsProblem Recent Solvers11
Suggested Problems
-
2463 Solvers
-
Project Euler: Problem 3, Largest prime factor
1561 Solvers
-
295 Solvers
-
Back to basics 19 - character types
262 Solvers
-
Make a run-length companion vector
640 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!