ExpertChains and uniqueness

Alternating Inference Chain (AIC)

A short chain of strong and weak links whose matching endpoints eliminate a candidate.

What it is

An Alternating Inference Chain, or AIC, connects candidates through strong and weak links. A strong link says at least one of its two candidates must be true. A weak link says they cannot both be true. For the endpoint elimination shown here, the chain must start and finish with a strong link, with strong and weak links alternating in between. If the first candidate is false, the next becomes true, the following one false, and so on until the last becomes true. Therefore at least one endpoint candidate is true. If both endpoints use the same digit, remove that digit from any other cell that sees both endpoints: it must share a row, column or box with each endpoint. This removes a candidate; it does not yet place a digit.

How to spot it

Use the complete candidates of the current position; any earlier removals need a valid logical reason. Start with exactly two places for one digit in a row, column or box, or with a bivalue cell. Join those candidates with a strong link, then alternate weak and strong links without revisiting a candidate. For this endpoint elimination, stop only after a strong link when the last candidate has the same digit as the first. Remove that digit only from cells outside the chain that see both endpoints. Matching digits alone are not enough, and seeing only one endpoint is not enough either. A bivalue cell can allow a digit change inside the chain. No uniqueness assumption is needed.

Worked example

Check the chain for 1: r4c9 – r2c9 – r1c7 – r1c4 – r8c4 – r8c1. Its five links are strong, weak, strong, weak, strong. Finally compare both endpoints with r4c1.

Step 1 of 4: Start with 1

Start with candidate 1 in r4c9. The other endpoint is r8c1. No digit has been placed or removed yet.

Why it matters

AIC gives you one way to understand several advanced Sudoku patterns. Instead of memorising a separate shape for each, you follow a sequence of small, justified connections. Learn simpler chains first, then use the interactive links to practise this wider approach.

Practise now

Recognise and apply the technique in a matching practice position.

Practise now

Frequently asked questions

What is the difference between a strong and weak link?

A strong link says one of its two candidates must be true, such as the only two places for a digit in a unit. A weak link only says the two candidates cannot both be true, such as two equal digits sharing a unit.

Why must the endpoints have the same digit for this AIC endpoint elimination?

A chain with strong links at both ends proves that at least one endpoint candidate is true. It does not prove that both are true or tell you which one is true. If both endpoints use digit d, candidate d in an outside cell that sees both conflicts with a true endpoint in either case. Only that candidate is eliminated.

Is an AIC a guess?

No. Every edge is reconstructed from the visible candidates in the current grid. The chain is accepted only when the links alternate correctly and the complete elimination set follows from the endpoints.

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