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 any number of moves to solve. The function you write has to determine if the initial state is a potential answer—i.e., if toggling only the starting lights are sufficient to solve the board.
Prev.: 5x5, any number of moves —
Next: 5x5, light-only solution? II
Sorted highest to lowest?
Volume of a Parallelepiped
String substitution, sub problem to cryptoMath
Find a Pythagorean triple
Legend of Zelda - Rupee Count (Compact)
Lights Out 3 - 5x5, 6 moves
Pattern Recognition 3 - Variable Unit and Array Length (including cell arrays)
Divisible by 16
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