Problem 44764. Lights Out 10 - 5x5, with wrapping, 6 moves
Solution Stats
Problem Comments
-
4 Comments
Show
1 older comment
William
on 30 Apr 2019
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.
William
on 30 Apr 2019
...also, how does the assert(numel(moves)==6) work on the problem that has only 3 moves?
goc3
on 30 Apr 2019
@William: the troublesome test case has been removed. Thanks for pointing that out.
Augusto Mazzei
on 3 Oct 2019
some cases admit shorter solution ^^'
Solution Comments
Show commentsProblem Recent Solvers11
Suggested Problems
-
22556 Solvers
-
Remove the small words from a list of words.
1275 Solvers
-
Find state names that start with the letter N
1100 Solvers
-
4278 Solvers
-
Sum all integers from 1 to 2^n
13003 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!