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
Return the largest number that is adjacent to a zero
Find state names that start with the letter N
sum of first 'n' terms
Length of a short side
Divisible by 13
Combined Ages 1 - Symmetric, n = 3
Not square-free number sequence
Evened up (or not)
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