Puzzle—Shedding Light on Higher Dimensions
Lights Out puzzles have been a popular computer pastime since the eighties. They consist of a grid of cells with each cell in one of two states, lit or unlit. When a cell is clicked, then that cell and its immediate neighbors toggle between lit and unlit. The objective is to identify the set of cells that must be clicked such that the entire grid is lit. Many variations on this theme devised by Jaap Scherphuis are at www.jaapsch.net/puzzles/lights.htm and one particularly interesting twist is at www.jaapsch.net/puzzles/java/lograph/lographapp.htm . This page implements, in the form of a Java applet, a set of tools to allow the creating, editing and playing of Lights Out puzzles on graphs. The nodes of the graph represent cells, and edges join any two cells that are considered neighbours. I show how to formulate Lights Out puzzles as integer programs and produce solutions using GLPK and Minisat. These are, respectively, open source software programs to solve Integer Programs and Satisfiability problems and are available within the GUSEK environment which may be downloaded from http://gusek.sourceforge.net/gusek.htm.
Volume (Year): 15 (2015)
Issue (Month): 2 (January)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:orited:v:15:y:2015:i:2:p:197-199. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.