Solving Lights Out Puzzle with Java

instructions

Lights are placed in N x N grid. Each of them can be ON (1) or OFF (0). When a light is toggled, from ON to OFF or OFF to ON,so are its horizontal and vertical neighbors – if any of them exists. Find a way to switch off all lights and print one possible sequence. The number of moves in this sequence is minimum. Display the light states in each move, until all lights are OFF.