Problem 44764. Lights Out 10 - 5x5, with wrapping, 6 moves

Created by goc3

Solve Later

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 six moves to solve. However, now wrapping of the lights occurs. For example, if

 board = [1 0 0 0 1
          1 0 1 0 1
          0 0 0 0 0
          1 0 1 0 1
          1 0 0 0 1]

the answer is:

 moves = [1 5 11 15 21 25]

Prev.: 5x5, light-only solution? II — Next: 5x5, wrapping, x moves

Solve

Solution Stats

Last solution submitted on Aug 24, 2019

Last 200 Solutions

Problem Comments

3 Comments

3 Comments

William on 30 Apr 2019

The first test suite problem is troublesome because it requires only 3 moves, and the 3-move solution is not necessarily the first one it finds that has 6 moves or less.

William on 30 Apr 2019

...also, how does the assert(numel(moves)==6) work on the problem that has only 3 moves?

goc3 on 30 Apr 2019

@William: the troublesome test case has been removed. Thanks for pointing that out.