Skip to content
Coronet
Suggest an idea

Leaderboard handle

Step 8 of 8

Count a hungry pillar

Needs two, has two open neighbors. There’s nothing left to decide.

The rule of thumb: A pillar that still needs torches with only just enough open neighbors forces every one of them.

When a pillar still needs torches and only just enough open neighbors remain, every one of those neighbors holds a torch. It’s simple subtraction — need minus placed equals open — but mid-game, with your eye on the lighting, it’s the easiest count in the game to skip.

This is the workhorse: on most boards a big share of the torches comes from counting, pillar by pillar. Torches forced around one pillar never see each other (the pillar sits between any two in line), but each one lights a whole cross — after placing them, mark their sight lines X. These practice boards can’t be finished any other way.

Where to look: Any pillar whose number is close to its open-neighbor count. Count need, count placed, count open — when the three line up, fill them all.

Worked example

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

Count the pillar at row 3, column 2 (purple): it still needs torches, and the dashed cells are exactly the open neighbors it has left.
The "2" pillar at row 3, column 2 still needs 2 torches and only 2 open cells remain.

Practice it ↓

Practice

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

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

Finish Count a satisfied pillar to unlock this practice.

Go to Count a satisfied pillar

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

All steps · ← Count a satisfied pillar · Play Crownlight →