Solving rules

← Back to helper

The helper works out the values each cell could still have, and which neighbouring cells are, or can't be, one domino. The game has no pencil marks, so hints skip what you'd see at a glance: the easy rules below run silently.

Every hint places exactly one domino: an easy one (shown in grey) when there is one, otherwise the reasoning from the hint rules that unlocks a placement, with that domino shown in green.

Pips puzzles can have more than one valid solution, so no rule assumes there's only one.

Easy: applied silently

Fixed region

Some conditions allow only one value. A one-cell 4 region is 4, a one-cell >5 is 6, and anything marked <1 is all 0s. A region adding up to 0 is all 0s, and one adding up to 6 × its size is all 6s.

Dead end

Every cell is covered by a domino, and a domino covers two neighbouring cells. If a cell has only one neighbour it can still pair with, that's its partner. Once two cells are joined, neither can pair with anyone else, which often creates the next dead end, so narrow corridors unzip from their ends.

Domino ends

Two joined cells must be one of the dominoes still in the tray, so each end limits the other.

One end is 6, and the only unplaced dominoes with a 6 are 6|1 and 6|4, so the other end is 1 or 4.

Used up

Every half in the tray ends up on the board, so a value appears exactly as many times as the tray shows it. Once that many cells are known to be 3, no other cell can be 3.

Region limits

In a sum, < or > region, the other cells can only add up to so little or so much, which limits each cell.

In a three-cell 15 region, the other two cells add up to at most 12, so every cell is at least 3.

All equal

Every cell in an = region has the same value, so each keeps only the values all of them can have. The tray also has to hold enough of that value: a four-cell = region of 2s needs four halves showing 2.

All different

Every cell in a ≠ region has a different value, much like a Sudoku row. A known value can't appear again, and if two cells can only be the same two values, nobody else in the region can have them. If only as many values are available as the region has cells, it uses exactly those.

Doesn't fit

Two neighbouring cells can only be one domino if some unplaced domino fits their possible values, and suits any region they share. If none does, they're different dominoes.

Two neighbours that must both be 6 can't be one domino unless the tray has a 6|6.

Domino inside a region

A domino lying entirely inside one region must suit it on its own: inside an = region it's a double, inside a ≠ region it isn't, and inside a sum region its pips count towards the total.

Only cover

List every way a cell could be covered: which neighbour, which domino, which way round. If there's only one, that's it. If they all give the cell the same value, that's its value.

Hints: counting and the whole board

Where do the 6s go?

Every half has to land somewhere. If two 6s still need a place and only two cells can still be 6, both of them are.

Only home

Look for an unplaced domino with very few places to go. Doubles and extremes like 6|6 or 0|0 are the usual suspects. If there's only one place, it goes there. If every place it could go covers the same cell, that cell is one of its values.

Stranded cells

Dominoes can't reach across between separate gaps, so each gap has to be fillable on its own. A gap with an odd number of cells can't be, and neither can one whose cells, coloured like a chessboard, aren't half one colour and half the other. If joining two cells would leave such a gap, they're different dominoes.

Sum combinations

For a small region, list every way to fill it that fits its condition, its cells' possible values and what the tray holds. Values that appear in none of them can go.

A two-cell 10 region could be 4 + 6 or 5 + 5. If the tray has only one 5, it's 4 and 6.

Shared supply

List every way to fill every region at once. The tray holds a fixed number of each value and all of them end up on the board, so a filling of one region is out if it would use more of a value than the other regions leave, or leave more than the rest of the board can take.

Every way to fill two other regions uses at least three 2s, and one cell is already a 2. The tray has four, so this region can't use any.

Board total

The tray's pips add up to a known total, and every pip lands somewhere. So the cells outside the exact-sum regions hold the total minus those regions' targets, which works like one more sum region (the same idea as the "45 rule" in Killer Sudoku).

Last resorts

What if?

Assume something (a cell's value, or that two cells are one domino) and follow the simpler rules until something breaks: a cell with no values left, a domino with nowhere to go, a region that can't be satisfied. Then the assumption was wrong.

Reveal

When nothing else applies, the helper places one domino from a valid solution. If the puzzle can be finished more than one way, it says so: that part is a free choice.