Build a room out of mirrors and stand a candle anywhere inside. Light bounces forever, into every corner. Surely the whole room fills with light? Not always — and the reason is one stubborn fact about a bouncing ball.
Here is a question that sounds like it can only have one answer. You have a room whose walls are perfect mirrors. You place a single candle somewhere inside. Light leaves the flame in every direction at once, reflects off the walls — angle in equals angle out — and keeps going, bouncing without loss. Is there always a spot to stand the candle so that every point in the room is lit?
Ernst Straus asked exactly this in the 1950s. In 1969 Victor Klee sharpened it to the case that feels most obviously hopeless to break — rooms with straight walls, ordinary polygons. The intuition is overwhelming: light is relentless, it gets everywhere, a polygon has no curves to focus the rays into a trap. The answer, found by George Tokarsky in 1995, is no. There is a 26-sided room, and two points inside it, such that a candle at one of them leaves the other in total darkness — no ray, in any direction, after any number of bounces, ever arrives.
That room is below. The candle is the bright point; the dark point wears a faint cross. Aim beams, sweep them, flood the room. One warning, and it's the strangest part of the whole thing: you will not see the darkness. Light crowds arbitrarily close to the dark point — beams thread past it by less than the width of a pixel — and still, not one ray passes through the exact point. The darkness here is too fine for the eye. It lives in the arithmetic, which is exactly why the verifier matters.
The trick to thinking about this is to forget light and think about a billiard ball. A ray of light reflecting off a mirror obeys the same law as a frictionless ball bouncing off a cushion: it leaves at the angle it arrived, mirrored across the wall. So "can a candle at A illuminate point B?" becomes "is there a billiard shot from A that passes through B?" Same question, and the billiard version comes with two centuries of machinery.
The machinery's central move is unfolding. Instead of bouncing the ball off a wall, reflect the room across that wall and let the ball fly straight on into the mirror-image copy. Do this at every bounce and the zig-zag trajectory straightens into a single ruler-straight line, passing through a chain of reflected rooms. A bounce path from A to B exists exactly when a straight line from A reaches some mirror-image of B. The whole problem turns into a question about straight lines and a lattice of reflected tiles — and that we can reason about exactly.
Tokarsky's room is built entirely out of one humble right triangle — the 45-45-90, half a square — reflected over and over. And the single fact that makes the room work is this:
A billiard ball launched from the corner of a square can never return to that corner. Not to a nearby spot — to the corner itself, the exact point it started from.
Why? Unfold the square. Reflecting it across its walls tiles the whole plane with a grid of unit squares, and every corner of every copy sits on an integer lattice point (a,b). The ball's path straightens to a line from the origin. The first corner it can reach is the first lattice point the line meets — and for a line in primitive direction (p,q) (with no common factor), that first point is (p,q) itself. Since p and q share no factor, they're never both even — so the corner reached is never of the same parity as the start corner (0,0). The ball lands in a different corner, always. To come home it would need an (even,even) target, and that point always hides behind a nearer corner the ball strikes first. Slide the launch angle below and watch: it visits the other three corners freely, and home never.
Half a square is the 45-45-90 triangle, and the same argument, folded once more, says: a billiard ball launched from a sharp (45°) corner of that triangle can never return to it — every trajectory from that corner leaves it for good. This is Tokarsky's lemma, and it is the whole engine.
Now the construction almost builds itself. Tile a polygon out of reflected 45-45-90 triangles. Arrange it so that two interior points both fold down onto the same corner of the fundamental triangle — the forbidden corner. Then a billiard path from one point to the other, when you fold the room back up, becomes a trajectory in the little triangle that leaves the forbidden corner and returns to it. The lemma says no such trajectory exists. So no path connects the two points. So a candle at one cannot light the other. The darkness is not approximate — it's a parity argument, exact and total.
Tokarsky's room takes 29 of these triangles and arranges them into 26 walls. Its two magic points are the ones marked in the instrument above; the verifier confirms they share the forbidden parity, and that 1,440 exact billiard shots fired from one never reach the other. The grey grid you can switch on shows the triangles the room is really made of.
Tokarsky's was the first polygonal answer, but Klee's question had a second life as a contest for fewest walls. D. Castro trimmed it to a 24-sided room in 1997 (try it with the toggle); in 2019 Amit Wolecki reached 22, and whether anything smaller exists is still unknown. Roger Penrose had actually found a dark room back in 1958 — but with curved, elliptical walls, which can focus rays the way a whispering gallery does; Klee's polygonal version is the harder, sharper question.
One honest caveat, and it's a beautiful one. In a polygon with all-rational angles the dark set is tiny: Lelièvre, Monteil and Weiss proved in 2016 that from any point, you illuminate all but finitely many other points. So Tokarsky's room doesn't hide a dark region — it hides a dark point. Stand at the candle and the whole room floods with light except for that single, unreachable pinprick. The wonder isn't a shadow. It's that a shadow can shrink to one exact point and still refuse, forever, to be lit.
E. Straus, problem posed in the 1950s. — V. Klee, "Is Every Polygonal Region Illuminable from Some Point?" (1969) — the polygonal version. — R. Penrose, in "Puzzles for Christmas", New Scientist (1958) — the curved-wall counterexample.
G. W. Tokarsky, "Polygonal Rooms Not Illuminable from Every Point", Amer. Math. Monthly 102 (1995) 867–879 — the 26-gon and the corner lemma.
D. Castro, feedback in Quantum magazine (1997) — the 24-gon. — A. Wolecki, "Illumination in Rational Billiards", arXiv:1905.09358 (2019) — the 22-gon, and a restatement of Tokarsky's construction.
S. Lelièvre, T. Monteil, B. Weiss, "Everything is illuminated", Geometry & Topology (2016) — the dark set of a rational polygon is finite.
Room shapes parsed verbatim from Wikimedia Commons, Tokarsky_Castro_illumination_problem.svg (CMG Lee, after MathWorld's Illumination Problem).