# “Lights Out” and Variants

• Published in 2017
In the collection
In this article, we investigate the puzzle “Lights Out” as well as some variants of it (in particular, varying board size and number of colors). We discuss the complete solvability of such games, i.e., we are interested in the cases such that all starting boards can be solved. We will model the problem with basic linear algebra and develop a criterion for the unsolvability depending on the board size modulo 30. Further, we will discuss two ways of handling the solvability that will rely on algebraic number theory.

## Other information

key
LightsOutandVariants
type
article
2019-12-09
date_published
2017-09-14
journal
The American Mathematical Monthly: Vol 124
volume
124
number
10

### BibTeX entry

@article{LightsOutandVariants,
key = {LightsOutandVariants},
type = {article},
title = {“Lights Out” and Variants},
author = {Martin Kreh},
abstract = {In this article, we investigate the puzzle “Lights Out” as well as some variants of it (in particular, varying board size and number of colors). We discuss the complete solvability of such games, i.e., we are interested in the cases such that all starting boards can be solved. We will model the problem with basic linear algebra and develop a criterion for the unsolvability depending on the board size modulo 30. Further, we will discuss two ways of handling the solvability that will rely on algebraic number theory.},
comment = {},
}