Choose your next move by tracing the ray, finding the first cell where it diverges from your intended route to OUT, and changing only the mirror at that turn. In Mirror Reflection Puzzle, that turns each five-by-five board into a sequence of testable direction decisions instead of a guess about the entire solution.
Every level begins with a marked entry and one required exit. An empty cell lets the ray continue straight, while a diagonal mirror changes its direction by 90 degrees. The five fixed boards progress from a single turn to a four-mirror route, so choosing one justified move at a time is more reliable than filling several cells at once. The ray must leave through the exact OUT edge; reaching another border does not count.
Make the Decision from the Ray
Your next action may be to place a mirror, change a mirror’s orientation, or clear one. Decide by comparing your prediction with the highlighted trace. If you expected the ray to continue straight but it turned, clear the mirror so the ray passes straight through the empty cell. If you expected a turn but the ray stayed straight, add a mirror at that cell. If the route approached the correct area but left through another edge, revise the turn that sent it out.
The useful information is on the board itself. After a trace, visited cells display the ray’s outgoing direction. Read those directions from the entry forward and locate the first mismatch with your plan. That cell is your next editing point. Later cells may also be wrong, but correcting the first divergence usually gives you a cleaner second trace and avoids rearranging mirrors that were already working.
Match Mirror Orientation to the Needed Direction
The puzzle follows the familiar equal-angle reflection principle summarized in OpenStax’s explanation of the law of reflection, but the game expresses it as a fixed lookup table. You do not need to estimate an angle; choose the orientation that produces the exact outgoing direction you require.
| Incoming direction | Slash turns it to | Backslash turns it to |
|---|---|---|
| Right | Up | Down |
| Up | Right | Left |
| Left | Down | Up |
| Down | Left | Right |
Neither symbol means “turn left” or “turn right” in every situation. A slash sends rightward travel upward but leftward travel downward; a backslash supplies the complementary turns. Use the table whenever the current direction and required direction are not obvious. For another focused explanation of these tiles, see Mirror Laser Puzzle Game: How Slash Tiles Route Rays.
Choose and Test Each Next Step
- Locate the exact endpoints. Find the marked entry and the specific OUT edge. Note the direction in which the ray enters the board and the direction it must have when it leaves through OUT. Do not treat any other border as success.
- Derive the final direction. Work backward from OUT and identify the direction the ray needs in the target cell. At the preceding turn, use the mapping table to decide whether a slash or backslash can create that direction.
- Place one justified mirror. Clicking or tapping a cell cycles it from empty to slash, backslash, and empty again. With the keyboard, move the selected cell with the arrow keys, type a slash or backslash to place that mirror, and press 0 to clear it. Orientation buttons provide another placement method.
- Trace the candidate route. Choose Trace ray or press Enter. The game highlights the route cell by cell and shows the outgoing direction on visited cells, giving you a concrete prediction to inspect.
- Find the first divergence. Walk through the trace from the entry and compare each actual outgoing direction with the direction you intended. Change or remove the mirror at the first mismatched cell rather than rebuilding the whole board.
- Respond to the stop reason. If the ray leaves through the wrong edge, revise the turn that directed it there. If it enters a loop, change one mirror in the closed segment so the ray can continue toward OUT.
- Retrace after each meaningful change. A repeated trace of the identical failed layout does not consume another attempt, so it is safe to inspect the same result again. A second distinct failed layout does end the run.
- Continue through all five boards. An exact OUT result clears the current level and presents the next fixed board. Repeat the same backward-planning and forward-tracing process until every level is solved.
Build the Route Backward from OUT
Backward reasoning turns the question “Which mirror should I place?” into a specific directional question. At the target cell, determine which direction the ray must travel to leave through OUT. Look one cell earlier along that approach. If the ray arrives moving right and must leave upward, for example, a slash supplies that turn. If it arrives moving upward and must leave rightward, a slash again supplies the required change. Continue backward, adding only the turns needed to connect that final segment to the entry path.
On longer levels, place only the turns you can justify and trace early. The highlighted path will reveal the first place your prediction differs from the actual route. Mirrors outside the active path do not affect the ray, but leaving unused cells empty makes the intended route easier to audit. Once the backward chain reaches the entry path, compare it with a forward trace; any remaining mismatch identifies the orientation that needs one final adjustment.
Use Trace Feedback to Diagnose the Problem
The tracer stops for three distinct reasons: it reaches the target, exits through a different board edge, or detects that the same cell with the same incoming direction would repeat. Those outcomes call for different corrections, so read the status rather than treating every failed trace as one generic error.
| Trace outcome | What it means | Best next move |
|---|---|---|
| Exact OUT | The ray reached the required exit edge. | The level is clear; continue to the next board. |
| Wrong edge | The ray crossed a boundary other than OUT. | Inspect the last highlighted turn and redirect it toward OUT. If the ray crossed straight, place a mirror earlier along that run. |
| Loop | The same cell and incoming direction would repeat. | Change one turn inside the closed highlighted segment so the ray exits the cycle. |
A wrong-edge diagnosis points backward from the boundary, while a loop diagnosis points inward to the closed segment. In either case, change the earliest mirror responsible for the bad route. Tracing the revised layout will show whether that change produced the intended outgoing direction or whether another turn is needed.
Protect the Run and the Score
A wrong trace counts only when the current mirror layout is distinct. Checking the same failed layout again does not consume another attempt, but a second different failed layout ends the run. This makes careful prediction important: place a turn you can explain, trace it, and inspect the result before introducing another unrelated variation. Completed and failed states are frozen, so extra clicks or key presses cannot alter a recorded result.
Scoring is transparent. Every solved level is worth exactly 200 points, and a complete five-level run is worth exactly 1,000 points. Restart restores level one, an empty placement map, zero mistakes, and zero points. The board, ray tracing, and score calculation run locally in the browser, with no account, upload, or server calculation required. A best score can be kept in local browser storage, but storage is optional and the live run remains usable if it is unavailable.
Keep the Puzzle Model in Perspective
Mirror Reflection Puzzle is a discrete grid game, not a precision optics simulator. It represents travel with four cardinal directions and uses ideal 45-degree diagonal mirrors. It does not model mirror thickness, wavelength, refraction, scattering, brightness, polarization, imperfect surfaces, or real measurements. The Physics Classroom’s law-of-reflection explainer can clarify the equal-angle principle behind the turns, but it does not define the game’s board coordinates or solutions.
The five boards are fixed original game fixtures. They do not shuffle, and there are no random seeds, hidden rules, or timers. That makes a failed route reproducible: the same layout produces the same trace. Use that determinism to learn from the first divergence, then make a deliberate correction rather than relying on repeated random guesses.
Repeat One Decision Loop
At each turn, ask four questions: What direction is entering the cell? What direction must leave it? Which orientation produces that result? Does the highlighted trace confirm it? If not, edit the first divergent cell and trace again. This loop combines backward planning from OUT with forward verification from the entry, while the exact direction table removes the need for visual guesswork. It is a reliable way to choose the next move, diagnose a failed trace, and work through all five mirror grids without unnecessary changes.
Related reading: How to Explain Number Fill-In Puzzle Rules to Someone.