-
Notifications
You must be signed in to change notification settings - Fork 82
Light Up Rules
Light Up is a puzzle with unfilled squares shown in gray. The goal is to light up every cell in the grid by placing light bulbs in some of the cells.
Clicking on an unfilled tile places a light bulb and colors the area it lights up yellow
Clicking on a light bulb replaces it with an "empty" tile, represented by a black dot
Clicking on a "empty" tile returns it to being unfilled
- Light bulb: a cell from which light is emitted in straight lines from. A bulb cannot be in another’s light path. This is a cell state.
- Light path: A direct line of sight to a light bulb. This is not a cell state which the user can directly add; it is automatically added when a light bulb is placed. Light is stopped by black blocks which are fixed on the board.
- A cell either has a bulb or is empty
- Each cell must be lit by a light
- Each numbered black block must have exactly that many bulbs around it
- No bulb can be in another’s light path.
- Light is emitted from a straight line from a bulb, stopped by blocks, in the four adjacent directions.(automatic)
Relative to a black numbered square: Any placement of light bulbs around that number which satisfies the number (takes into account already placed lightbulbs, and makes all other cells white).
Relative to an unlit cell, at least one of the unknown (and unlit, to reduce the number) cells that can light up that cell (this could include itself) contains a lightbulb
Rule comes directly from Rule #2. There is no derivation to avoid a light bulb to be placed in a lit path.
Rule is a derivation of rule #2 and the goal state. There is no possible way for a bulb to be placed to light a particular cell. All cells that can possibly light that cell (including itself) are empty.
Rule comes directly from Rule #3. There is no way to satisfy a number in a black square
Rule comes directly from Rule #3. There is no way to lower the number of bulbs to match the black square that they surround
Rule comes directly from Rule #2. Any unknown lit cell must be empty
This rule is a derivation of Rules #1 and #3. The diagonal corners of a numbered square are empty (Rule #3 forces those corners to be empty in each possible case)
Rule comes directly from Rule #3. If the sum of a block’s unknown cells and its light bulb cells equals its number, then the unknown cells must contain bulbs
Rule comes directly from Rule #3. If a block with a number has as many light bulbs around it as its number, the other cells around it must not contain a light bulb and therefore be empty
Rule is a derivation of the goal. If there is only cell from which an unlit cell can be lit from, then that cell must have a bulb
- Home
-
For Developers
- Programming Standards
- Developer Setup Guide
- Alternative Developer Setup Guide (linux)
- Pointers for Getting Started
- Guide to Implementing Puzzles
- Guide to Implementing the Puzzle Editor Functionality for a Puzzle
- Native Binary Compilation Information for Windows
- Test Suite Documentation
- Notes for a Future Rewrite
- For End Users