Switch toggling games such as Lights Out and the σ+-game are widely studied in mathematics and have been applied to model a variety of situations such as genetic networks and cellular automata. This paper introduces a class of toggling games where at each iteration a fixed number of switches is chosen to be toggled where the only switches changed are the switches chosen to be toggled. The switches all operate independently of each other and do not depend on the proximity or the position relative to any other switch. This paper classifies the conditions necessary and the steps taken to transition from all switches in the on state to all switches in the off state. Further results include the conditions required of the parity between the number of switches in the system and the fixed number of switches toggled at each step in order to transition from a given initial state to a specified terminal state.
Prof. Richard Daquila, Department of Mathematics and Computer Science, Muskingum University
"A Non-geometric Switch Toggling Problem,"
Rose-Hulman Undergraduate Mathematics Journal: Vol. 14
, Article 4.
Available at: http://scholar.rose-hulman.edu/rhumj/vol14/iss2/4