Problem 44764. Lights Out 10 - 5x5, with wrapping, 6 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 ^^'
Problem Recent Solvers10
Suggested Problems
-
3507 Solvers
-
2241 Solvers
-
How many trades represent all the profit?
557 Solvers
-
472 Solvers
-
Rounding off numbers to n decimals
2310 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!