Remote Pair

A Remote Pair is a chain made entirely from bivalue cells that contain the same two candidates.

Suppose every cell in the chain contains only {4,7}.

Because each cell must be either 4 or 7, connected cells that see each other must take opposite values. That creates an alternating pattern along the chain:

4 / 7 / 4 / 7 ...

or the exact reverse:

7 / 4 / 7 / 4 ...

If an outside cell sees two Remote Pair cells that must have opposite values, that outside cell cannot contain either digit from the pair.

The technique is one of the simplest ways to move from local bivalue cells into general chain reasoning.

Quick rule

A standard Remote Pair requires:

1. a sequence of bivalue cells;
2. every chain cell contains the same pair {X,Y};
3. each consecutive pair of chain cells sees each other;
4. values therefore alternate X/Y along the chain;
5. choose two chain cells with opposite polarity;
6. any outside cell that sees both cannot contain X or Y.

Why identical bivalue cells create a chain

Take two cells that both contain only {2,8} and see each other.

They cannot both be 2 because they share a house.

They cannot both be 8 for the same reason.

Since both cells must take one of those two values, they must be opposite:

if A = 2 → B = 8
if A = 8 → B = 2

Now connect B to another {2,8} cell C that sees B.

C must be opposite B, so C has the same polarity as A.

Continue the process and the values alternate along the chain.

This deterministic alternation is the heart of Remote Pair.

Step-by-step Remote Pair example

Remote Pair polarity

It is often helpful to think of the cells as two alternating colors or polarities.

For example:

A — B — C — D

can be labelled:

blue — green — blue — green

If the pair is {4,7}, then one of these global assignments must be true:

blue = 4, green = 7

or:

blue = 7, green = 4

You do not need to know which assignment is correct.

You only need to know that cells of opposite polarity contain opposite digits.

Why a common peer can lose both pair digits

Suppose target T sees:

• one blue Remote Pair cell;
• one green Remote Pair cell.

Those two chain cells contain 4 and 7 in some order.

So T sees a 4 in one branch and a 7 in the other chain cell — regardless of which color receives which value.

Therefore T cannot be 4 or 7.

If T has candidates:

{1,4,7}

the Remote Pair removes 4 and 7, leaving:

{1}

and T becomes a Naked Single.

If T contains only one of the pair digits, remove whichever pair candidate is present.

Why the chain normally needs at least four cells to eliminate both digits

With only two connected {X,Y} cells, the relationship is local and usually behaves like an ordinary bivalue pair relationship inside a shared house.

A useful remote elimination appears when the alternating chain extends far enough that two opposite-polarity cells have a common peer elsewhere in the grid.

Four cells are the smallest common practical form:

A — B — C — D

A and D have opposite polarity.

A target that sees both can eliminate X and Y.

Longer even-length chains can create the same relationship between more distant opposite-polarity cells.

Remote Pair as a Chain

Remote Pair is not an isolated trick.

It is a constrained chain family where:

• every node is a bivalue cell;
• every cell uses the same two digits;
• the Strong Link is inside each bivalue cell;
• Weak Links connect matching candidates between cells that see each other.

In formal chain notation, the inference alternates naturally because a bivalue cell says:

if X is false here, Y must be true here.

and a shared house says:

if Y is true here, Y must be false in the next cell.

This is why Remote Pair is an excellent bridge into XY-Chain and broader AIC reasoning.

Remote Pair vs XY-Chain

The two techniques are closely related.

Remote Pair

Every cell contains the same two candidates.

Example:

{2,8} — {2,8} — {2,8} — {2,8}

XY-Chain

Each cell is bivalue, but the candidate pairs may change as the chain progresses.

Example:

{2,8} — {8,5} — {5,3} — {3,2}

Remote Pair is therefore a more restricted and visually repetitive form of bivalue chaining.

If you understand why Remote Pair alternates, XY-Chain is the natural generalization.

Remote Pair vs Simple Coloring

Remote Pair can also be interpreted with two-color logic.

The chain cells alternate between two polarities exactly like a colored network.

The difference is that Remote Pair tracks two cell values at once through identical bivalue cells, while Simple Coloring usually tracks the truth state of one candidate digit through a network of conjugate pairs.

Some Remote Pair eliminations can be reproduced using one or two Simple Coloring arguments.

Choose whichever representation makes the contradiction easiest to verify.

Remote Pair vs W-Wing

Both involve matching bivalue cells, but the connection mechanism is different.

W-Wing

Two matching {X,Y} cells do not need a chain of identical pair cells between them. Instead, a separate Strong Link on one candidate connects the logic and forces the other candidate into one of the two wing cells.

Remote Pair

A sequence of matching bivalue cells propagates alternating values directly from one pair cell to the next.

The visual similarity — repeated identical pairs — can make the techniques easy to confuse.

Ask what actually carries the inference:

• external Strong Link → W-Wing;
• alternating chain of identical pair cells → Remote Pair.

How to find Remote Pairs

1. Look for repeated bivalue pairs

Scan your candidate grid for a pair such as {3,9} appearing in several cells.

2. Connect cells that see each other

Two matching pair cells can form consecutive chain nodes only if they share a row, column, or box.

3. Extend the chain

Follow another matching pair cell that sees the current endpoint.

Keep the chain simple: each step should depend only on the immediately preceding cell.

4. Assign alternating polarity

Mark the chain mentally or visually:

A / B / A / B / A / B

5. Search opposite-polarity common peers

An outside cell seeing one A-polarity node and one B-polarity node cannot contain either pair digit.

6. Apply only the candidates actually present

If the target contains X but not Y, remove X only. If it contains both, both can be removed.

7. Re-scan the grid

Remote Pair eliminations frequently create Singles or simplify candidate structures.

Chains can turn corners

Remote Pair cells do not need to lie on one straight line.

The chain can move through:

• a row;
• then a box;
• then a column;
• then another box;
• and so on.

The requirement is local:

each consecutive pair of cells must see each other.

That is why Remote Pairs can connect cells that appear far apart in the finished chain.

Not every repeated pair belongs to the same Remote Pair

Suppose five cells all contain {4,7}.

That does not automatically make one valid chain.

You must be able to connect the cells through actual peer relationships in a sequence where the alternating implication is valid.

Disconnected matching pairs have no shared polarity unless another logical relationship links them.

This is the same caution used in Coloring: do not transfer color or parity between disconnected components without proof.

Common Remote Pair mistakes

Mistake 1: one chain cell has a third candidate

A cell {2,8,9} is not bivalue, so the internal 2/8 Strong Link does not exist.

Mistake 2: consecutive cells do not see each other

Matching candidate lists alone are not enough. The Weak Link between cells requires a shared house.

Mistake 3: using two cells with the same polarity for the elimination

Two same-polarity cells may both take X under one branch and both take Y under the other.

A target seeing them is not guaranteed to see both pair values.

Use opposite-polarity cells.

Mistake 4: assuming every common peer loses every candidate

Only the two Remote Pair digits are affected.

Other candidates in the target cell remain untouched.

Mistake 5: mixing candidate pairs along the chain

Once the pairs change, you are no longer using a Remote Pair. You may instead have an XY-Chain.

Mistake 6: treating disconnected pair groups as one network

Without a valid link between components, their polarity relationship is unknown.

A practical recognition shortcut

When candidate notation is visible:

1. pick a recurring bivalue pair such as {2,8};
2. visually highlight every cell with exactly that pair;
3. connect only cells that see each other;
4. look for a path of four or more nodes;
5. alternate two colors along the path;
6. inspect cells that see opposite colors.

This is much faster than trying to reason from every bivalue cell on the board simultaneously.

FAQ

What is a Remote Pair in Sudoku?

It is a chain of bivalue cells containing the same two candidates. Values alternate along the chain, allowing the pair digits to be eliminated from cells that see opposite-polarity chain nodes.

How many cells are needed for a Remote Pair?

A useful remote elimination normally requires at least four chain cells. Longer chains are possible.

Can Remote Pair eliminate both candidates from a cell?

Yes. If the target sees opposite-polarity Remote Pair cells, it cannot contain either pair digit. If those are its only two candidates, the supposed target would be impossible, so valid puzzle states will normally present another candidate or a different consequence.

Does every Remote Pair cell need exactly the same candidates?

Yes for the standard technique. Every chain cell is bivalue and contains the same pair {X,Y}.

Is Remote Pair an XY-Chain?

It is closely related and can be understood as a restricted bivalue chain. XY-Chains generalize the idea by allowing the candidate pair to change from cell to cell.

Can Remote Pairs be solved with Coloring?

Many Remote Pair deductions can be represented using coloring logic because the chain naturally alternates between two polarities.

What to learn next

Continue to XY-Chain to allow the candidate pair to change from cell to cell, or review Simple Coloring if you prefer to reason through alternating polarities visually.