Alexander Giffen

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The Lights Out game on a graph G is played as follows. Begin with a (not necessarily proper) coloring of V (G) with elements of Z2. When a vertex is toggled, that vertex and all adjacent vertices change their colors from 0 to 1 or vice-versa. The game is won when all vertices have color 0. The winnability of this game is related to the existence of a parity(More)
  • 1