ExpertChains and uniqueness

Nice Loop

A closed alternating chain that proves a candidate false, true, or impossible outside the loop.

What it is

A Nice Loop is an Alternating Inference Chain (AIC) that returns to the same candidate in the same cell. A strong link means: if one end is false, the other must be true. It occurs when a digit has exactly two possible positions in a row, column or box, or when a cell has exactly two candidates. A weak link means: if one end is true, the other must be false. Same-digit candidates sharing a unit and different candidates in one cell exclude each other this way. Links alternate along the chain. Two weak links at the start eliminate the starting candidate; two strong links place it. In a continuously alternating loop, exactly one end of each weak link is true. An outside candidate of the same digit that sees both ends of that link can therefore be removed. Candidates see each other when their cells share a row, column or box.

How to spot it

Start with complete, current candidate notes. Trace the chain one link at a time without repeating a candidate before closure. Check every strong link against its entire unit, not just the highlighted cells. With two weak links at the start, assume for the proof that the starting candidate is true: the alternating implications must make it false on returning. With two strong links, assuming the starting candidate false must instead lead to a contradiction. If the link types alternate at closure too, look for outside candidates of the same digit that see both ends of a weak link. Two weak links alone are not enough: the entire path between them must alternate correctly.

Worked example

One question per step: find the repeated start, trace the alternating links, inspect the closing links, then cross out the returned candidate.

Step 1 of 4: Find the returning candidate

Start with candidate 5 in 4/7. The loop must return to this digit in this exact cell. Nothing is removed yet.

Why it matters

Nice Loops help when a useful chain returns to its starting point rather than ending elsewhere. They extend the AIC idea and can reveal a safe deduction that simpler patterns miss. Learn strong and weak links before working through the example.

Practise now

Recognise and apply the technique in a matching practice position.

Practise now

Frequently asked questions

What makes a Nice Loop different from an AIC?

An AIC is a chain of alternating inferences between candidates. A Nice Loop returns to its starting candidate. A weak or strong discontinuity eliminates or confirms that starting candidate, while a continuous loop can remove a candidate outside the loop.

What is a weak discontinuity?

Two weak links meet at the starting candidate while the rest of the loop alternates weak and strong links. Assuming that candidate is true carries the implications around the loop until the same candidate must be false. The contradiction rules it out. The interactive example shows each link in order.

Does a Nice Loop ever guess?

No. Sudoku Luna rebuilds every strong and weak link from the current candidate state. The step is accepted only when the loop closes with the right alternation and the complete consequence is verified.

Put it to use

Where you will meet it

Use your candidate notes to look for this pattern in an Expert grid. Its availability depends on the position, not only the difficulty label.

Play Expert

Stuck on a grid of your own?

Enter the position in the solver. It explains the safe steps it finds with supported techniques and stops if it cannot prove further progress. It may not use this particular technique.

Open the solver

Prefer paper? Ready-made Expert sets as a PDF.Print puzzles

Finished reading? Mark it done and the learning path remembers where you got to.

Related techniques