150 likes | 238 Vues
Dive into the strategic world of switch toggling games, exploring the rules and transitions in systems of switches. Understand the interplay between toggles, states, and parity for successful transitions.
E N D
A Non-geometric Switch Toggling Game Megan Duke Muskingum University
Lights Out by Tiger Relies on the position of the chosen switch
An example of a system of 7 switches with a 5-toggle transition rule applied
Graph of a system of 7 switches with a 5-toggle transition rule applied
Graph of a system of 9 switches with a 4-toggle transition rule applied States and are in different components of the graph.
Achieving the state depends on the parity of , the number of switches in the system and , the number of switches being toggled. If is odd, a system of switches can be transitioned from to . If is even, a system of switches can be transitioned from to only when is even.
When is odd and Method: Apply to to get Apply to times to get Apply to to get decreases the number of switches on by
When is odd and Method: Apply to to get Apply to to get Apply to to get Case: is odd This case is always done in steps.
A system of switches with a -toggle transition rule applied A system of switches with a -toggle transition rule applied
When is even and is odd Given is even, is even. From an initial state , any sequence of transition rules yielding the state will have . There are no transition rules to go from to .
When is even and Method: Apply to to get Apply to times to get Apply to to get Consider only when is even decreases the number of switches on by
Transitioning from a given initial state to a specified terminal state depends on the parity of . If is odd, a system of switches can be transitioned from to. If is even, a system of switches can be transitioned from toonly when .