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 eight moves to solve. For example, if
board = [0 1 0 1 0
1 0 0 0 1
0 0 0 0 0
1 0 0 0 1
0 1 0 1 0]
the answer is:
moves = [2 4 6 10 16 20 22 24]
Prev.: 5x5, 6 moves —
Next: 5x5, 10 moves
Your solution is fastest so far.
Good job, Athi.
@Athi, your solution contains many "magic" constant variables that I don't know how you got.
William's solution is much easier to understood, although it is slower than yours.
Thanks li haitao.
The Goldbach Conjecture, Part 2
Find last non-zero in a given dimension
Find the largest value in the 3D matrix
Multiply a column by a row
Rule of mixtures (composites) - weighted bound
Divisible by 11
Scrabble Scores - 10
Legend of Zelda - Rupee Count
Word Distance - Average Sort
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office