Skip to content
Coronet
Suggest an idea

Leaderboard handle

Step 7 of 8

Count a satisfied pillar

A pillar that has its torches is a "0" in disguise: no more torches beside it.

The rule of thumb: A numbered pillar with all its torches placed marks the rest of its neighbors X.

A numbered pillar that already holds all the torches it asked for is done giving. Every remaining neighbor gets an X — the quiet counterpart to the "0" pillar: not "no torches" but "no more torches". Make it automatic the moment a count is met.

Satisfied pillars are anchors. Their X’d neighbors narrow the candidate sets of nearby dark rooms and the open counts of neighboring pillars, which is often what finally forces the next torch. These practice boards are chosen so that skipping the count leaves them stuck.

Where to look: Pillars whose placed torches match their number. Recheck them after every placement near them.

Worked example

A real position from a board that needs Count a satisfied pillar. Purple: what the reasoning rests on. Dashed: the cells in question. Green: what it proves.

The pillar at row 4, column 3 (purple) already has all its torches. The dashed cells are its remaining neighbors.
The "2" pillar at row 4, column 3 already has its torches, so none of its other neighbors can hold one.

Practice it ↓

Practice

Three boards that can’t be finished without Count a satisfied pillar.

Count a satisfied pillar · practice 1 of 30/0 rooms lit

Finish The last dark room to unlock this practice.

Go to The last dark room

Tap a room to cycle: empty → X (mark) → torch → empty. Marking first is how the deductions work.

All steps · ← The last dark room · Count a hungry pillar → · Play Crownlight →