On weight-one solvable configurations of the Lights Out puzzle

DOI10.2140/INVOLVE.2019.12.713zbMath1414.05193OpenAlexW2941141319WikidataQ127998128 ScholiaQ127998128MaRDI QIDQ2424276

Masakazu Yamagishi, Yuki Hayata

Publication date: 24 June 2019

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/involve.2019.12.713

zbMATH Keywords

linear codepath graphCartesian productLights Out

Mathematics Subject Classification ID

Games involving graphs (91A43) Linear codes (general theory) (94B05) Paths and cycles (05C38) Other types of codes (94B60) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Lights Out On A Random Graph

Cites Work

• Unnamed Item
• Unnamed Item
• Linear cellular automata and the garden-of-eden
• \(\sigma\)-Automata and Chebyshev-polynomials
• Periodic harmonic functions on lattices and Chebyshev polynomials
• A Survey of the Game “Lights Out!”
• On the Dimension of the Space of Harmonic Functions on a Discrete Torus

This page was built for publication: On weight-one solvable configurations of the Lights Out puzzle