If you have worked your way through the basics of Sudoku—naked singles, hidden singles, and even naked pairs—and still find yourself staring at a grid that refuses to budge, it may be time to step up to chain-based logic. Remote Pairs is one of those elegant, satisfying techniques that sits at the intersection of simplicity and power. It does not require you to track dozens of cells at once, yet it can crack open puzzles that seem completely locked. In this guide, we will walk through exactly what Remote Pairs are, why they work, how to spot them in a real grid, and how to use them to make confident eliminations—without guessing.
What Are Remote Pairs?
A Remote Pair is a chain of cells that all share exactly the same two candidate digits. Each cell in the chain sees the next one (meaning they share a row, column, or box), and the chain must contain at least four cells. Because every cell holds only two possibilities, you can think of each link in the chain as a simple on/off switch: if one digit is true in a cell, the other digit must be false, and the next cell in the chain flips to the opposite state.
The term “remote” refers to the fact that the two ends of the chain do not necessarily see each other directly—they may be far apart in the grid. Yet the alternating logic of the chain still connects them. This is what makes the technique both powerful and surprising: you can draw conclusions about cells that appear to have no obvious relationship.
Remote Pairs belong to a broader family of solving methods called chains or alternating inference chains (AICs). Other related techniques include X-Chains, XY-Chains, and Skyscrapers. If you are comfortable with naked pairs and conjugate pairs, Remote Pairs are a natural next step. They use the same foundation—bivalue cells—but extend it across multiple links.
The Logic Behind the Technique
To understand why Remote Pairs work, you need to grasp the concept of a bivalue cell. A bivalue cell is any cell with exactly two candidates remaining. In a valid, unique Sudoku puzzle, one of those two candidates must be the correct answer. There is no third option.
Now imagine two bivalue cells, both containing the same two digits—let us call them digit A and digit B. If these two cells see each other (same row, column, or box), they form a naked pair, and you can eliminate A and B from other cells in that shared unit. But what if they do not see each other? That is where Remote Pairs come in.
Suppose you have four bivalue cells, all containing digits A and B, forming a chain where each consecutive pair of cells sees each other:
- Cell 1 sees Cell 2
- Cell 2 sees Cell 3
- Cell 3 sees Cell 4
Now apply alternating logic. If Cell 1 contains digit A, then Cell 2 must contain digit B (because they share a unit and both hold only A or B). If Cell 2 is B, then Cell 3 must be A. If Cell 3 is A, then Cell 4 must be B. Alternatively, if Cell 1 contains B, the chain flips: Cell 2 is A, Cell 3 is B, Cell 4 is A.
Notice that the first and last cells of the chain (Cell 1 and Cell 4) are always assigned opposite digits from each other. This is the key insight. Any cell that sees both Cell 1 and Cell 4 can never contain either A or B—because whichever digit appears in Cell 1, the opposite digit appears in Cell 4, and that external cell would be forced to be both, which is impossible. You can safely eliminate both A and B from any such cell.
This rule only applies when the chain has an even number of cells. With an odd number of links, the two ends would hold the same digit, not opposite ones, and the elimination logic changes entirely.
A Worked Example: Finding and Using a Remote Pair
Let us walk through a concrete illustration. Suppose your Sudoku grid has four cells that each contain only the candidates 3 and 7, and they connect in the following way:
- Cell P — Row 1, Column 2 — candidates: {3, 7}
- Cell Q — Row 1, Column 8 — candidates: {3, 7}
- Cell R — Row 5, Column 8 — candidates: {3, 7}
- Cell S — Row 5, Column 4 — candidates: {3, 7}
Check the links: P and Q share Row 1. Q and R share Column 8. R and S share Row 5. Each consecutive pair sees each other. We have a valid four-cell chain.
Now apply the alternating logic:
- If P = 3, then Q = 7 (same row), then R = 3 (same column), then S = 7 (same row).
- If P = 7, then Q = 3, then R = 7, then S = 3.
In every possible scenario, P and S hold opposite digits. Now ask: is there any cell in the grid that sees both Cell P and Cell S? Suppose Cell T is at Row 5, Column 2. It shares Row 5 with Cell S and shares Column 2 with Cell P. Cell T therefore sees both ends of the chain.
Because P and S always hold different values of {3, 7}, Cell T cannot be either 3 or 7—it would conflict with whichever end of the chain matches. If Cell T currently lists 3 or 7 as a candidate, you can eliminate both of them from Cell T with complete confidence. This is not guessing—it is ironclad logic.
You can extend this same reasoning to longer chains: six cells, eight cells, and so on, as long as the cell count remains even and every consecutive pair shares a unit. The elimination rule stays the same: any cell seeing both the first and last cell of the chain loses both candidates.
How to Spot Remote Pairs in a Grid
Finding Remote Pairs requires a systematic approach. Here is a reliable method to scan your grid:
- Identify all bivalue cells. Go through the grid and mark every cell that has exactly two candidates. Many solvers circle these cells or highlight them in a different color.
- Group by candidate pair. Sort your bivalue cells by which two digits they contain. You are looking for groups of cells that all share the identical pair—for example, all cells containing {2, 9} or all cells containing {4, 6}.
- Build a graph. For each group, draw connections between cells that see each other (same row, column, or box). You are looking for a path through this graph that links at least four cells in a chain.
- Count the chain length. Make sure the chain has an even number of cells. A four-cell chain is the minimum. Six and eight-cell chains also work.
- Find external cells. Look for any cell that sees both the first and the last cell in your chain. Check whether that external cell has either of the two chain digits as a candidate.
- Eliminate. If an external cell sees both ends and holds one or both of the chain digits, eliminate those digits. Then continue solving with other techniques.
One useful tip: if you are solving on paper, lightly number the cells in your chain (1, 2, 3, 4…) to keep track of the alternating pattern. On a digital solver, you can often color-code the chain using two alternating colors to visualize the on/off switching.
Common Mistakes and How to Avoid Them
Remote Pairs are logically airtight when applied correctly, but there are a few pitfalls to watch out for:
- Using an odd-length chain for Remote Pair eliminations. An odd-length chain means the two ends hold the same digit, not opposite digits. The elimination rule for Remote Pairs requires an even-length chain. Odd-length chains can still be useful, but they follow different logic (they prove one of the digits for the end cells rather than eliminating from external cells).
- Skipping a link check. Every consecutive pair in your chain must genuinely share a row, column, or box. A chain with a broken link is invalid, and any eliminations based on it are wrong. Double-check every connection.
- Including non-bivalue cells. Every cell in a Remote Pair chain must contain exactly the same two candidates—and only those two. If a cell has a third candidate, it breaks the strict alternating logic and the technique does not apply.
- Forgetting to check both chain digits. When you find an external cell that sees both ends, you can eliminate both chain digits from it (if present), not just one.
If you make an elimination and your puzzle leads to a contradiction, go back and verify each link in the chain before assuming your broader logic is wrong. A simple link error is often the culprit.
Remote Pairs Versus XY-Chains
It is worth briefly comparing Remote Pairs to the closely related XY-Chain technique, since solvers often encounter both when working on difficult puzzles. An XY-Chain is a more flexible type of chain that also passes through bivalue cells, but the cells in an XY-Chain do not all need to share the same pair of candidates. Each link shares one digit with the next cell, but the overall chain can use many different digit pairs.
Remote Pairs are actually a special case of XY-Chains—specifically, XY-Chains where every cell in the chain happens to contain the same two digits. Because of this restriction, Remote Pairs are easier to spot and verify. If you are new to chain logic, mastering Remote Pairs first gives you a solid mental model before tackling the full flexibility of XY-Chains and other advanced alternating inference chains.
Both techniques belong to the same logical family and complement each other well. In hard or expert-level Sudoku puzzles, you will often use Remote Pairs alongside techniques like X-Wings, Swordfish, hidden pairs, and pointing pairs to systematically eliminate candidates until the solution reveals itself.
Key Takeaways
- A Remote Pair is a chain of four or more bivalue cells, all containing the same two candidates, where each consecutive cell shares a row, column, or box with the next.
- The alternating logic of the chain means the two end cells always hold opposite digits from each other.
- Any cell that sees both end cells of the chain can have both chain digits safely eliminated from its candidate list.
- The chain must have an even number of cells for this elimination rule to apply.
- Every link in the chain must be genuine—each consecutive pair must share a Sudoku unit.
- Remote Pairs are a special case of XY-Chains and a great stepping stone toward more advanced chain-based logic.
- Scanning for bivalue cells and grouping them by candidate pair is the most reliable way to find Remote Pairs in a tough grid.
Chain-based strategies like Remote Pairs reward patient, systematic thinking. The moment you trace a chain across a grid and spot that external cell with candidates ready to be eliminated, it feels genuinely satisfying—like finding a hidden passage in a puzzle that looked impenetrable. Keep practicing your candidate tracking, stay alert for bivalue cells, and you will find that Remote Pairs open doors in difficult grids that no simpler technique could unlock. Head over to the puzzle section at playsudoku.org and try applying this technique on a hard or expert puzzle today—you may be surprised how quickly it changes your approach.