How to play
Lights Out
A 5 × 5 logic puzzle where every press changes one light and its orthogonal neighbors. Every published board is solvable.
Medium · 4 min
Turn off all 25 lights by finding the right sequence of presses.
How to play
A 5 × 5 logic puzzle where every press changes one light and its orthogonal neighbors. Every published board is solvable.
Press a light to change it and its direct neighbors.
Watch how each move changes the row below it.
Finish when all 25 lights are off.
Complete guide
Lights Out turns a simple instruction, switch off twenty-five lights, into a precise cause-and-effect puzzle. Every square is both a lamp and a switch. Pressing it reverses its own state and the state of its immediate neighbors above, below, left, and right. A move that removes three bright cells may restore two that were already dark, so chasing isolated lights rarely produces a controlled solution. The useful shift is to see every press as part of a board-wide pattern that can be organized one row at a time.
The NextGamings edition keeps the classic five-by-five grid and builds each challenge by applying a sequence of presses to a completely dark board. That construction guarantees a solution: applying the same set again, or finding an equivalent set, returns all twenty-five cells to off. A score begins at 10,000 points and loses 140 per move plus 8 per second, with a floor of 500. Finishing matters, while a short route without canceling presses earns the stronger result.
This guide follows the documented history of the commercial game, explains what a press does at the center, edges, and corners, and develops the standard row-chasing method through the final row. It also gives an approachable account of parity and linear algebra. You do not need to memorize a matrix to play well. You need to understand why a choice on the first row determines every forced action below it and how to test that choice without drifting into random corrections.
Tiger Electronics issued the classical edition in 1995 as a single-player electronic game. Its defining physical feature was a five-by-five array of illuminated buttons, each serving as an indicator and a switch. Modern mathematical literature consistently uses that product as the reference point for the classical puzzle. Historical wording should remain careful: Tiger established and marketed the familiar Lights Out form, while switching puzzles, grid processes, and related cellular-automaton questions had earlier precedents. The documented claim is the 1995 commercial edition, not that one company invented every neighboring-toggle idea.
The design attracted mathematical attention because its rules are short but its structure supports much larger questions. Researchers asked which starting patterns can be solved, when several press sets produce the same result, and what happens on rectangles, connected surfaces, or general graphs. Marlow Anderson and Todd Feil presented a linear-algebra treatment in the late 1990s, and later work extended the model to more board sizes and states. A Missouri State University thesis, for example, studies general rectangular boards and uses Fibonacci polynomials to describe aspects of the solution space.
Moving the puzzle into a browser removes the plastic hardware but preserves its central mechanism. Software can generate repeatable boards, count every move, and validate a complete replay. It can also avoid an important source of frustration: not every one of the roughly thirty-three million imaginable on-off patterns on a 5x5 grid is necessarily reachable from the all-off board. NextGamings does not choose the twenty-five lamp states independently. It begins at all off and makes between eight and fourteen distinct seeded presses. The resulting board therefore belongs to the solvable set by construction.
The objective is to leave all twenty-five cells off. A press toggles states: on becomes off, and off becomes on. At an interior cell it changes a cross of five, consisting of the chosen button and four orthogonal neighbors. At a non-corner edge there are only three neighbors, so four cells change. A corner has two neighbors and changes three cells. Diagonal cells are never affected. This clipped geometry is why a pattern copied from the center behaves differently against the boundary.
No button is locked, and you may press a lit or unlit cell. A valid solution sometimes has to illuminate a region temporarily. The final state also does not depend on the order when the same set of cells is pressed. A followed by B ends like B followed by A, even though the intermediate animation differs. Pressing one cell twice reverses the first effect exactly and is equivalent to leaving that cell untouched. An efficient solution therefore needs at most one useful press at each position.
The on-screen counter reports how many lights remain, but it is not a reliable strategy by itself. A correct move can increase that count before a later press clears the row. The score values both moves and time, although the 140-point move penalty outweighs several seconds of inspection. Pausing to read a row is usually better than making a speculative click. Arrow keys move focus around the grid, while Enter or Space activates the selected cell, so the complete game can be played without a pointer.
The most practical general procedure is called light chasing. First choose which cells, if any, to press in the top row. This is the only exploratory part of the method, and the next section explains how to test it. Once that top choice is complete, inspect the lights that remain on in row one. For each lit cell there, press the cell directly beneath it in row two. That lower press is the only remaining action that can clear the lamp above without using another button in its own completed row.
Repeat the rule downward. Use row three to clear every lamp left on in row two, row four to clear row three, and row five to clear row four. Do not try to improve two rows at once. Finish one complete row, verify that it is dark, and only then read the next. By the time you finish the chase, the first four rows will be off automatically. The only unresolved evidence will be the pattern in the fifth row.
There is no sixth row from which to repair the fifth. If the bottom row is fully dark, the first-row choice was correct and the puzzle is solved. If lights remain, the procedure did not fail; the starting choice was wrong for this board. Reset the same challenge and try a different top pattern. Five top buttons allow only 32 possible patterns, including pressing none and pressing all five. An orderly search of that small space is far more dependable than random corrections near the bottom.
For a manual record, number columns one through five and write the first press set as something like {1, 3, 4}. Perform the full chase without deviation and note the bottom result. If it fails, reset and change the initial set. A learning session can test no top press first, then each single button, followed by pairs. Enumeration is not the fastest leaderboard technique, but it turns a visually noisy board into a reproducible experiment and makes the first-row-to-last-row relationship visible.
A new player often presses whichever lamp looks most troublesome. That reaction can improve the board briefly, but previously dark cells return and the causal trail disappears. Replace visual whack-a-mole with one rule: choose an opening row, move downward in order, and do not go back. If an accidental press occurs, the clearest recovery is to press the same cell once more immediately, canceling the mistake before continuing the plan.
Use row-and-column references. Thinking 'row three, column two' prevents two similar crosses from blending together. Before pressing an edge, anticipate its shortened cross; before pressing a corner, remember that only three lamps change. After each action during a chase, check the lamp directly above the current button. It should now be off. This local check catches execution mistakes without requiring you to retain the whole board at once.
Practice accuracy before pace. The clock continues, but one extra press costs the same points as 17.5 seconds under this score formula. A short inspection often pays for itself. Once the process is reliable, gain speed in batches: read an entire row, identify its lit columns, and then press the corresponding cells below. Do not alternate reading and clicking so quickly that you forget whether a remembered state belongs before or after the latest move.
The last row acts as a signature of the opening choice. After the first four rows have been chased correctly, no free decisions remain: each lower press was forced by the light above it. Two attempts that begin with the same set on row one will produce the same bottom pattern. This is why recording results matters. You are not searching arbitrary sequences across twenty-five buttons; you are examining a function that maps 32 possible openings to five-light residues.
An advanced player can reduce trials by learning correction patterns for the top row. Another approach solves a small binary system that directly identifies the five opening buttons. Both methods use the same principle: observe the bottom residue and choose a top adjustment whose chased effect cancels it. Cancellation is exact here. If two plans affect a given lamp, it receives two toggles and returns to its previous state; if only one plan affects it, the lamp changes.
A found solution may still be optimized. Some press patterns leave the entire board unchanged, which means different solutions can clear the same starting board with different move totals. If the immediate objective is completion, any valid route is enough. For a higher score, remove repeated buttons and compare complete alternatives instead of adding improvised shortcuts halfway through a chase. NextGamings knows a generating sequence internally but does not reveal it, so finding a compact route remains the player's work.
The mathematics of Lights Out uses two values: zero for off and one for on. Adding one changes the state. Adding another one makes two, which becomes zero again in arithmetic modulo two. That is parity: only an even or odd number of effects matters. The same applies to buttons. A cell needs to be pressed zero or one time in a reduced solution; two presses cancel, three are equivalent to one, and the pattern repeats.
Each button can be represented by a column containing ones at the cells in its cross and zeros elsewhere. The initial board is another collection of zeros and ones. Solving means selecting columns whose binary sum equals the initial pattern, because applying that sum once more takes it to zero. Linear algebra organizes all twenty-five conditions together. It also proves two practical facts: move order does not alter the end state, and some arbitrary boards lie outside the space of patterns that the switches can reach.
This edition's guarantee can be understood without calculating a matrix rank. When software creates a board from zero by pressing a set of buttons, the board is already the sum of those crosses. Applying the same set cancels that sum and restores zero. A shorter solution may exist, but at least one is certain. The generation method keeps difficulty in discovering a pattern instead of asking the player to wonder whether the challenge was impossible from the start.
Frequent mistakes include treating diagonals as part of the cross, chasing a row before the one above is fixed, moving upward to repair one lamp, and unknowingly repeating a button. The total light count also misleads players because it can rise during a correct solve. When the process becomes confused, resetting the same seeded board allows a clean execution of the plan. Layering impulsive repairs on top makes it difficult to know which opening was actually tested.
Useful practice separates goals. In the first round, solve without caring about time and verify every row. In the second, eliminate duplicate presses. In the third, read lit columns in groups to improve fluency. Classify a failure: did you misread a lamp, transfer it to the wrong button below, or forget the opening set? That classification supplies a concrete adjustment for the next attempt and prevents fast execution from being mistaken for sound strategy.
Within its own task, the game uses spatial tracking, sequential planning, parity recognition, and error review. It is reasonable to improve at chasing rows, anticipating crosses, and finishing this board in fewer moves. It should not be described as treatment, clinical assessment, or proof of broad gains in memory or reasoning. Honest measurements are already visible: time, presses, lights remaining, and consistency when repeating the same challenge.
Yes. Each board is constructed from the all-off state with a deterministic set of presses. Applying that set again would return the board to zero, so at least one solution always exists, although another sequence may use fewer moves.
The selected cell and its immediate orthogonal neighbors change. An interior button affects five lamps, an edge button affects four, and a corner affects three. Diagonal cells do not change.
Not to the final board when the same set of buttons is used. Toggles add modulo two and can occur in any order. A consistent order still helps a person execute and verify the method accurately.
The top-row selection was not the right one for that board. Intermediate rows are forced by the chasing rule. Reset the challenge, change the opening pattern, and perform the downward chase again.
No. A solution may require pressing an unlit cell to change the other lamps in its cross. Follow a row pattern or calculated solution instead of judging a button only by its current state.
Prioritize a short solution because each move costs much more than a few seconds of analysis. Remove duplicate buttons, finish one method cleanly, and then compare complete alternatives. The score has a 500-point minimum.