A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Consider a game played on a simple graph G = (V, E) where each vertex consists of a clickable light. Clicking any vertex v toggles the on/off state of v and its neighbors. Starting from an initial configuration of lights, one wins the game by finding a solution: a sequence of clicks that turns off all the lights. When G is a 5 × 5 grid, this game was commercially available from Tiger Electronics as Lights Out. Restricting ourselves to solvable initial configurations, we pose a natural questionarXiv:2201.03452v4 fatcat:lg56wynod5chfnjxa57oox6r74