Lights Out on graphs

Abstract

We model the Lights Out game on general simple graphs in the framework of linear algebra over the field $$\mathbb{F}_{2}$$ F 2 . Based upon a version of the Fredholm alternative, we introduce a separating invariant of the game, i.e., an initial state can be transformed into a final state if and only if the values of the invariant of both states agree. We also investigate certain states with particularly interesting properties. Apart from the classical version of the game, we propose several variants, in particular a version with more than only two states (light on, light off), where the analysis relies on systems of linear equations over the ring $$\mathbb{Z}_{n}$$ Z n . Although it is easy to find a concrete solution of the Lights Out problem, we show that it is NP-hard to find a minimal solution. We also propose electric circuit diagrams to actually realize the Lights Out game.

Lights Out em grafos: apagando luzes da menor maneira

“…Existem muitas variantes para este jogo que vão desde uma mudanc ¸a no formato do quebra-cabec ¸as ou de possíveis configurac ¸ões iniciais, até diferentes objetivos a serem alcanc ¸ados. Podemos, por exemplo, ao invés de usar uma entrada em forma de grid, aplicar as mesmas regras a grafos de outras classes [Berman et al 2019]. Além disso, pode-se desejar minimizar o conjunto de vértices que, quando acionados, conduzem a uma configurac ¸ão final.…”