Vol. 12, No. 4, 2019

Download this article
Download this article For screen
For printing
Recent Issues

Volume 17
Issue 5, 723–899
Issue 4, 543–722
Issue 3, 363–541
Issue 2, 183–362
Issue 1, 1–182

Volume 16, 5 issues

Volume 15, 5 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Editors' interests
 
Subscriptions
 
ISSN 1944-4184 (online)
ISSN 1944-4176 (print)
 
Author index
To appear
 
Other MSP journals
On weight-one solvable configurations of the Lights Out puzzle

Yuki Hayata and Masakazu Yamagishi

Vol. 12 (2019), No. 4, 713–720
DOI: 10.2140/involve.2019.12.713
Abstract

We show that the center-one configuration is always solvable in the Lights Out puzzle on a square grid with odd vertices.

Keywords
Lights Out, path graph, Cartesian product, linear code
Mathematical Subject Classification 2010
Primary: 05C57
Secondary: 05C38, 91A46, 94B60
Milestones
Received: 22 September 2018
Accepted: 25 October 2018
Published: 16 April 2019

Communicated by Kenneth S. Berenhaut
Authors
Yuki Hayata
Field of Mathematics and Mathematical Science
Department of Computer Science and Engineering
Graduate School of Engineering
Nagoya Institute of Technology
Nagoya
Japan
Masakazu Yamagishi
Department of Mathematics
Nagoya Institute of Technology
Nagoya
Japan