Lights Out
Toggle a grid of illuminated nodes where pressing any tile inverts its own state and that of its four orthogonal neighbors, aiming to extinguish all lights.
HISTORICAL ORIGIN LORE
The Lineage of Lights Out
Released as an electronic handheld game by Tiger Electronics in 1995, invented by Avi Olti, Gyora Benedek, Zvi Hermann, Revital Bloomberg, Avi Keinan, and Michael Ganor. The mathematics behind Lights Out is governed by linear algebra over finite fields (Galois Field GF(2)), where finding the solution corresponds to solving a system of linear equations Ax = b (mod 2).
SYSTEM MECHANICS & RULES
Rules & Cognitive Architecture
Played on a 5×5 matrix of illuminated push-buttons.
Pressing a button toggles the illuminated state of that button and its immediate orthogonal neighbors (up, down, left, right).
Corner and edge buttons affect 3 and 4 nodes respectively.
The objective is to navigate from a randomized lighted configuration to a completely dark board (all lights out).
Trained Mental Models
- ▸Linear algebra modulo 2 elimination and row-chasing technique
- ▸Superposition principle intuition across overlapping toggle fields
- ▸Order independence awareness (move sequence commutative property)
INCLUDED FREE FOREVER
The Three Base Tiers
Gentle
3×3 and 4×4 grids with shallow move scrambles solvable within 3 to 5 toggles.
Standard
Standard 5×5 classic board with light-chasing row reduction mechanics.
Deep
5×5 challenging configurations with rank-deficient matrix parity demanding quiet linear foresight.
BEYOND+ MASTER EDITIONS
The Master Variants for Lights Out
Toroidal Matrix
Boundary wrap-around mechanics modeling a continuous 2D torus surface
Connects opposite boundaries of the board: toggling an edge button inverts nodes on the opposite edge, and corner toggles wrap diagonally, eliminating safe boundary walls.
- ·Toroidal coordinate wrap-around physics
- ·Cyclic matrix operator construction
- ·Non-boundary nullspace parity algorithms
Ternary Spectrum GF(3)
Three-state nodes (Off, Dim, Bright) governed by arithmetic modulo 3
Each node cycles through three states: Off → Dim → Bright → Off. Toggling a node increments its value and its neighbors modulo 3, requiring sophisticated GF(3) linear algebra to solve.
- ·Finite field Galois Field GF(3) matrix solver
- ·Tri-state cyclic state animation
- ·Modulo 3 Gaussian elimination verification
FREQUENTLY ASKED QUESTIONS
Questions on Lights Out Architecture
Does the order of button presses matter in Lights Out?
No. Because addition in GF(2) and GF(3) is commutative, pressing buttons in any order produces the exact same final board state.
What is light chasing?
Light chasing is a systematic algorithm where you toggle buttons on row N to extinguish lights on row N-1, pushing all illuminated nodes to the bottom row.
What makes Ternary Spectrum GF(3) unique?
In GF(3), lights have three intensities rather than two, meaning some buttons must be pressed twice to cycle through states.
MORE IN SEQUENCE
Explore Related Sequence Titles
Play Lights Out on Android
Available directly on Google Play with Gentle, Standard, and Deep tiers included free forever.