A Survey of the Game “Lights Out!”
From MaRDI portal
Publication:2848975
Recommendations
Cites work
- scientific article; zbMATH DE number 436064 (Why is no real title available?)
- scientific article; zbMATH DE number 3648727 (Why is no real title available?)
- scientific article; zbMATH DE number 3902703 (Why is no real title available?)
- scientific article; zbMATH DE number 3910441 (Why is no real title available?)
- scientific article; zbMATH DE number 4039319 (Why is no real title available?)
- scientific article; zbMATH DE number 4057564 (Why is no real title available?)
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- scientific article; zbMATH DE number 21231 (Why is no real title available?)
- scientific article; zbMATH DE number 3468636 (Why is no real title available?)
- scientific article; zbMATH DE number 3477211 (Why is no real title available?)
- scientific article; zbMATH DE number 1243360 (Why is no real title available?)
- scientific article; zbMATH DE number 734463 (Why is no real title available?)
- scientific article; zbMATH DE number 1156590 (Why is no real title available?)
- scientific article; zbMATH DE number 1161323 (Why is no real title available?)
- scientific article; zbMATH DE number 1934394 (Why is no real title available?)
- scientific article; zbMATH DE number 1944403 (Why is no real title available?)
- scientific article; zbMATH DE number 4114031 (Why is no real title available?)
- scientific article; zbMATH DE number 842019 (Why is no real title available?)
- scientific article; zbMATH DE number 871170 (Why is no real title available?)
- scientific article; zbMATH DE number 894703 (Why is no real title available?)
- scientific article; zbMATH DE number 975419 (Why is no real title available?)
- scientific article; zbMATH DE number 2197881 (Why is no real title available?)
- A linear algorithm for the domination number of a series-parallel graph
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
- Characterizing switch-setting problems∗
- Connected odd dominating sets in graphs
- Decomposition of additive cellular automata
- Domination in planar graphs with small diameter*
- Domination numbers of planar graphs
- Efficient dominating and edge dominating sets for graphs and hypergraphs
- Fibonacci polynomials and parity domination in grid graphs
- Generalized planar matching
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Linear cellular automata and the garden-of-eden
- Merlin's Magic Square
- Note on the lamp lighting problem
- On non-z(mod k) dominating sets
- On the computational complexity of finite cellular automata
- On the inherent intractability of certain coding problems (Corresp.)
- On three zero‐sum Ramsey‐type problems
- Parity dimension for graphs
- Perfect codes in graphs
- The Minimum All-Ones Problem for Trees
- The domination number of grids
- The domination numbers of the 5 × n and 6 × n grid graphs
- The intractability of computing the minimum distance of a code
- The σ-Game and Cellular Automata
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II
- Towards a theory of domination in graphs
- Two Reflected Analyses of Lights Out
- Unit disk graphs
- Universal configurations in light-flipping games
- \(\sigma\)-Automata and Chebyshev-polynomials
- \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
Cited in
(32)- Random Lights Out processes on graphs
- Fibonacci sequences and the winning conditions for the blackout game
- Chasing the lights in Lights Out
- Solutions to all-colors problem on graph cellular automata
- A family of multicolor lights out games
- Lights Out on finite graphs
- Lights Out on the hypercube graph over the ring of integers modulo \(k\)
- How to solve the game ``Lights-Out: an application of homomorphism in group theory
- On weight-one solvable configurations of the Lights Out puzzle
- scientific article; zbMATH DE number 7021370 (Why is no real title available?)
- An Easy Solution to Mini Lights Out
- A group-labeling version of the Lights Out game
- Solving systems of linear equations through zero forcing set
- An iterative strategy for Lights Out on Petersen graphs
- Two remarks on torus Lights Out puzzle
- Effects of edge addition or removal on the nullity of a graph
- Algebra in the game of ``lights-off
- Reversible peg solitaire on graphs
- Merging peg solitaire on graphs
- Linear algebraic approach on real \(\sigma\)-game
- Illuminating a graph.
- Lights Out! On graph products over the ring of integers modulo \(k\)
- On a switch-setting problem arising from a variation of the `Lights Out' game
- Solving alien tiles by an iteration method
- Lights Out! on Cartesian products
- The Lights Out game on subdivided caterpillars.
- ``Lights Out and variants
- Universal configurations in light-flipping games
- Generalized switch-setting problems
- Lights Out on graphs
- A Confused Electrician Uses Smith Normal Form
- Resolution of conjectures related to Lights Out! and Cartesian products
This page was built for publication: A Survey of the Game “Lights Out!”
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848975)
