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 four moves to solve. For example, if
board = [1 0 1 1 1
1 1 0 1 0
1 0 0 0 1
1 0 0 1 1
1 1 0 0 1]
the answer is:
moves = [2 5 16 24]
Prev.: 5x5, 3 moves —
Next: 5x5, 6 moves
Hello Grant, you should create a problems Group with the Lights Out serie.Good problems as always.
Or maybe add the Lights Out 1 and Lights Out 7 or 8 (for a progression in difficulty) in the Classic Games Puzzles. By the way I thing that problems in Computer Games 1 are more Maze problems (except 2048 Move). Some others Maze problems (One Track Five Lanes of Alfonso) can be added.
@Jean-Marie Sainthillier: thanks.
More problems will be coming in this series.
Back to basics 10 - Max Float
Sum of first n terms of a harmonic progression
Is the input divisible by 3?
Side of an equilateral triangle
Max Change in Consecutive Elements
Scrabble Scores - 10
Rule of mixtures (composites) - upper bound
Lights Out 1 - 5x5, 3 moves
Pattern Recognition 2 - Known Unit Length, Various Array Length (including cell arrays)
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