A Survey of the Game "Lights Out!"

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Space-Efficient Data Structures, Streams, and Algorithms

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1007/978-3-642-40273-9_13
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Domination Number of Grids

  2011cited by this paper
• A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs

  2008cited by this paper
• Connected odd dominating sets in graphs

  2005cited by this paper
• The Minimum All-Ones Problem for Trees

  2004cited by this paper
• Application of Upper and Lower Bounds for the Domination Number to Vizing's Conjecture

  2003cited by this paper
• On non-z(mod k) dominating sets

  2003cited by this paper
• Fibonacci Polynomials and Parity Domination in Grid Graphs

  2002cited by this paper
• Decomposition of Additive Cellular Automata

  2002cited by this paper
• Domination in planar graphs with small diameter *

  2002cited by this paper
• Mathematics and its applications

  2002cited by this paper
• Note on the Lamp Lighting Problem

  2001cited by this paper
• Universal configurations in light-flipping games

  2001influential reference
• Two Reflected Analyses of Lights Out

  2001cited by this paper
• Lights Out ! : A Survey of Parity Domination in Grid Graphs

  2001cited by this paper
• Two-Player Games on Cellular Automata

  2000cited by this paper
• Cellular automata : a parallel model

  1999cited by this paper
• sigma-Automata and Chebyshev-Polynomials

  1999cited by this paper
• On the Twin Designs with the Ionin-type Parameters

  1999cited by this paper
• Linear Cellular Automata and de Bruijn Automata

  1999cited by this paper
• Maximization Versions of “ Lights Out ” Games in Grids and Graphs

  1998influential reference
• Parity dimension for graphs

  1998cited by this paper
• Turning Lights Out with Linear Algebra

  1998cited by this paper
• Approximation Algorithms for NP-Hard Problems

  1997cited by this paper
• The intractability of computing the minimum distance of a code

  1997influential reference
• Perfect codes on graphs

  1997cited by this paper
• Characterizing switch-setting problems ∗

  1997influential reference
• Tight Upper Bounds for the Domination Numbers of Graphs With Given Order and Minimum Degree

  1997cited by this paper
• Domination numbers of planar graphs

  1996cited by this paper
• Packing Graphs: The packing problem solved

  1996cited by this paper
• Simple proofs to three parity theorems

  1996cited by this paper
• Unique Domination in Cross-Product Graphs

  1996cited by this paper
• Hardness Of Approximations

  1996cited by this paper
• sigma-Game, sigma+-Game, and Two-Dimensional Additive Cellular Automata

  1996cited by this paper
• Setting Switches in a Grid

  1995influential reference
• Another way to solve nine-tails

  1995cited by this paper
• On the Computational Complexity of Finite Cellular Automata

  1995cited by this paper
• Dynamic programming for pennies a day

  1994cited by this paper
• Constant Time Computation of Minimum Dominating Sets

  1994cited by this paper
• The domination numbers of the 5 × n and 6 × n grid graphs

  1993cited by this paper
• On three zero-sum Ramsey-type problems

  1993cited by this paper
• Applications of Discrete Mathematics

  1991cited by this paper
• Unit disk graphs

  1991cited by this paper
• De Bruijn Graphs and Linear Cellular Automata

  1991cited by this paper
• The σ-game and cellular automata

  1990influential reference
• PERFECT DOMINATING SETS

  1990cited by this paper
• Generalized Planar Matching

  1990cited by this paper
• Linear cellular automata and the garden-of-eden

  1989influential reference
• Minimum Odd Neighbourhood Covers for Trees

  1989cited by this paper
• Additive Automata On Graphs

  1988influential reference
• COMPUTING IN THE 90's

  1988cited by this paper
• Merlin's magic square

  1987cited by this paper
• A linear algorithm for the domination number of a series-parallel graph

  1983cited by this paper
• On Domination and Some Related Topics in Graph Theory

  1979cited by this paper
• The recognition of Series Parallel digraphs

  1979cited by this paper
• Graph-theoretic parameters concerning domination, independence, and irredundance

  1979cited by this paper
• On the inherent intractability of certain coding problems (Corresp.)

  1978cited by this paper
• Parsing flowcharts and series-parallel graphs

  1978cited by this paper
• Towards a theory of domination in graphs

  1977cited by this paper
• Combinatorics: Perfect codes and distance-transitive graphs

  1974cited by this paper
• Solution

  1902cited by this paper

• Graph Powers of Groups II: The RA Matrix

  2025cites this paper
• A Parameterized Perspective of All-Colors

  2025cites this paper
• Graph Powers of Groups

  2025cites this paper
• Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs

  2024cites this paper
• Residue Domination in Bounded-Treewidth Graphs

  2024cites this paper
• Agent Motion Planning as Block Asynchronous Cellular Automata: Pushing, Pulling, Suplexing, and More

  2024cites this paper
• Robust Neuro-Symbolic Goal and Plan Recognition

  2023cites this paper
• Decoding quantum color codes with MaxSAT

  2023cites this paper
• Solving systems of linear equations through zero forcing set and application to lights out

  2022cites this paper
• Generating and solving the LIGHTS OUT! game in first order logic

  2022cites this paper
• Lights Out em grafos: apagando luzes da menor maneira

  2022cites this paper
• Using Self-Attention LSTMs to Enhance Observations in Goal Recognition

  2020cites this paper
• A characterization of always solvable trees in Lights Out game using the activation numbers of vertices

  2020cites this paper
• A characterization of always solvable trees in the Lights Out game using the activation types of vertices

  2020cites this paper
• Solutions to All-Colors Problem on Graph Cellular Automata

  2019cites this paper
• Lights Out on graphs

  2019cites this paper
• On weight-one solvable configurations of the Lights Out puzzle

  2019cites this paper
• LSTM-Based Goal Recognition in Latent Space

  2018cites this paper
• The Ordered Covering Problem

  2018cites this paper
• Tic-Tac-Toe on graphs

  2018cites this paper
• Resolution of Conjectures Related to Lights Out! and Cartesian Products

  2018cites this paper
• Goal Recognition in Latent Space

  2018cites this paper
• LIGHTS OUT! on Cartesian Products

  2017cites this paper
• A Confused Electrician Uses Smith Normal Form

  2016cites this paper
• Reversible peg solitaire on graphs

  2014cites this paper
• Allowing unjumps in peg solitaire on graphs

  2014cites this paper
• NUMBER OF SOLUTIONS TO THE LIGTHS OUT GAME

  2014cites this paper