Click an open street cell to place or remove a beacon. Light travels in straight lines until a wall blocks it. Light every street with as few beacons as possible.
1level
0beacons
0%streets lit
0total score
How it plays. Three walled districts, 8Γ8, 9Γ9, 10Γ10.
A beacon lights its own cell and every open cell in the four straight lines from it,
until a wall (π§±) stops the light. Light travels through other beacons.
When every street is lit the level ends β its score is
round(1000 Γ fewest-possible-beacons Γ· your beacons) (max 1000 per level,
3000 total). The fewest-possible count is computed exactly and revealed when the level ends.
π District fully lit
π The town sleeps safe
β¦