A Survey of the Game “Lights Out!”
From MaRDI portal
Publication:2848975
DOI10.1007/978-3-642-40273-9_13zbMath1395.91075OpenAlexW114270063MaRDI QIDQ2848975
Publication date: 13 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40273-9_13
Related Items
Merging peg solitaire on graphs ⋮ On weight-one solvable configurations of the Lights Out puzzle ⋮ A Confused Electrician Uses Smith Normal Form ⋮ Resolution of Conjectures Related to Lights Out! and Cartesian Products ⋮ Solutions to all-colors problem on graph cellular automata ⋮ Unnamed Item ⋮ Lights Out on graphs ⋮ Reversible peg solitaire on graphs
Cites Work
- \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
- Unit disk graphs
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree
- Parity dimension for graphs
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II
- Fibonacci polynomials and parity domination in grid graphs
- Linear cellular automata and the garden-of-eden
- A linear algorithm for the domination number of a series-parallel graph
- On the computational complexity of finite cellular automata
- \(\sigma\)-Automata and Chebyshev-polynomials
- Perfect codes in graphs
- Merlin's Magic Square
- Graph-theoretic parameters concerning domination, independence, and irredundance
- The Domination Number of Grids
- Generalized planar matching
- On the inherent intractability of certain coding problems (Corresp.)
- Towards a theory of domination in graphs
- Characterizing switch-setting problems∗
- The intractability of computing the minimum distance of a code
- On non-z(mod k) dominating sets
- Domination in planar graphs with small diameter*
- The Minimum All-Ones Problem for Trees
- The domination numbers of the 5 × n and 6 × n grid graphs
- On three zero‐sum Ramsey‐type problems
- Two Reflected Analyses of Lights Out
- The σ-Game and Cellular Automata
- Domination numbers of planar graphs
- Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
- Connected odd dominating sets in graphs
- Note on the lamp lighting problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
