If you have ever stared at a Sudoku grid where every easy technique has already been applied and you still cannot find a way forward, you are ready to meet Remote Pairs. This elegant, chain-based strategy belongs to the intermediate-to-advanced tier of Sudoku solving methods, sitting comfortably alongside techniques like X-Wings and Skyscrapers. Once you understand the underlying logic, Remote Pairs will become one of your most satisfying tools — not just because it works, but because spotting one feels like uncovering a hidden thread woven through the entire puzzle.
What Are Remote Pairs?
A Remote Pair is a special application of a broader concept known as a chain or a conjugate pair chain. To understand it fully, you first need to be comfortable with the idea of a naked pair. A naked pair occurs when two cells in the same house (row, column, or box) each contain exactly the same two candidates and no others. Because one cell must hold one of those digits and the other cell must hold the remaining digit, you can safely remove both candidates from every other cell in that shared house.
Remote Pairs extend this logic across multiple cells that are not necessarily in the same house. The key requirement is that you can link these cells together in an unbroken chain, where each consecutive pair of cells in the chain shares a house. Every cell in the chain must contain exactly the same two candidates — let’s call them digit A and digit B. That last point is crucial: if any cell in the chain holds additional candidates beyond A and B, the chain breaks and the technique no longer applies.
The power of Remote Pairs comes from a fascinating property of these chains. Because each cell must be either A or B, and because cells that are directly linked must be different from each other (they share a house, so they cannot both be the same digit), the values alternate perfectly along the chain. Cell 1 is A, Cell 2 is B, Cell 3 is A, Cell 4 is B, and so on. This alternating pattern is the engine that drives the elimination.
The Core Elimination Rule
Once you have identified a valid Remote Pairs chain, the elimination rule is straightforward:
- Number the chain cells from 1 to N.
- Odd-numbered cells (1, 3, 5…) will hold one of the two digits.
- Even-numbered cells (2, 4, 6…) will hold the other digit.
- Any cell outside the chain that can see both an odd-positioned cell and an even-positioned cell can have both candidates A and B eliminated from it.
The reasoning is airtight: since odd cells hold one value and even cells hold the other, a cell that sees both an odd and an even chain cell is “seen” by whichever cell holds A and also by whichever cell holds B. No matter how the chain resolves, that outside cell cannot be A (because an odd cell will be A and sees it) and cannot be B (because an even cell will be B and sees it). Therefore, both A and B can be removed from that outside cell.
One critical rule: the chain must contain at least four cells for any elimination to be possible. With only two cells, you have an ordinary naked pair. With four or more cells (always an even number to guarantee the alternating pattern produces a useful result), you start generating eliminations in cells outside the chain itself.
A Worked Example
Let’s walk through a concrete illustration. Suppose you are solving a challenging Sudoku puzzle and you notice the following four cells, each containing only the candidates 3 and 7:
- Cell P — Row 2, Column 1 — candidates: {3, 7}
- Cell Q — Row 2, Column 5 — candidates: {3, 7}
- Cell R — Row 8, Column 5 — candidates: {3, 7}
- Cell S — Row 8, Column 9 — candidates: {3, 7}
Now check the links. P and Q share Row 2, so they are directly linked. Q and R share Column 5, so they are directly linked. R and S share Row 8, so they are directly linked. The chain is P → Q → R → S, and it is valid because each consecutive pair shares a house.
Next, assign positions. P is position 1, Q is position 2, R is position 3, S is position 4. Odd positions (P and R) will hold the same digit; even positions (Q and S) will hold the other digit.
Now look for any cell outside the chain that can see both an odd-positioned cell and an even-positioned cell. Specifically, look for a cell that can see P or R (the odd cells) and also see Q or S (the even cells).
Suppose there is a cell at Row 8, Column 1 that still has 3 and 7 as candidates. This cell shares Row 8 with S (position 4, an even cell) and shares Column 1 with P (position 1, an odd cell). Because it sees both an odd-positioned and an even-positioned chain cell, both 3 and 7 can be eliminated from it. If 3 and 7 were the only candidates in that cell, you would have found a contradiction — but assuming the cell also has other candidates, removing 3 and 7 is a valid and often very useful deduction.
Similarly, check every other cell in the grid that sees any combination of odd and even chain cells. Each one of those cells loses candidates 3 and 7. In a tricky puzzle, this elimination might be the only logical break available, making Remote Pairs the key that unlocks everything else.
How to Find Remote Pairs in Practice
Spotting Remote Pairs requires methodical candidate tracking. Here is a practical approach you can follow whenever you are stuck:
- Update your candidate lists first. Make sure you have applied all basic techniques — naked singles, hidden singles, naked pairs, and pointing pairs — so your candidates are as reduced as possible. Remote Pairs only work with cells containing exactly two candidates.
- List all bivalue cells. A bivalue cell is any cell with exactly two remaining candidates. Write down or mentally note every bivalue cell in the grid, along with which two digits they contain.
- Group by digit pair. Collect all bivalue cells that share the same pair of candidates. For example, gather all cells containing exactly {3, 7}. If there are fewer than four such cells, Remote Pairs cannot apply for that digit pair.
- Check for chain links. Among the cells sharing that digit pair, see if you can form a chain where each consecutive cell shares a row, column, or box with the next. The chain does not need to be a straight line — it can zigzag across the grid.
- Apply the alternating logic. Once you have a valid chain of four or more cells, label them by position and look for outside cells that see both an odd and an even chain member.
This process can feel slow at first, but with practice it becomes second nature. Many experienced solvers scan for bivalue cells automatically while reviewing the grid, making Remote Pair detection much faster over time.
Remote Pairs vs. Similar Techniques
It helps to understand where Remote Pairs fit within the broader landscape of Sudoku techniques. They are closely related to several other chain-based methods:
- Naked Pairs: The simplest version of the same idea — just two linked cells in the same house. Remote Pairs extend this concept across multiple houses.
- X-Chain: A chain built from a single digit’s strong and weak links. Remote Pairs work with two digits simultaneously across bivalue cells, which is a different flavour of chaining logic.
- XY-Chain: A more flexible chain technique that allows each link to involve a different pair of digits, as long as consecutive cells share one candidate. Remote Pairs are actually a specific subtype of XY-Chains where every cell contains the exact same two candidates.
- Simple Coloring: Also known as single-candidate chaining, this method follows one digit’s strong links across the grid. Remote Pairs can sometimes achieve the same eliminations but through a two-candidate lens.
Understanding these relationships helps you choose the right tool for each situation. If Remote Pairs do not produce any eliminations, expanding your thinking toward the more general XY-Chain might open new possibilities.
Common Mistakes to Avoid
Even once you understand the theory, Remote Pairs can trip you up in a few predictable ways:
- Breaking the chain with a non-bivalue cell. Every cell in the chain must contain exactly and only the two candidates in question. Including a cell with three or more candidates invalidates the entire chain.
- Forgetting the four-cell minimum. A two-cell “chain” is just a naked pair and produces no remote eliminations. You need at least four cells.
- Incorrect link checking. Two cells are only linked if they share a row, column, or box. Diagonal proximity does not count in standard Sudoku.
- Eliminating from chain cells themselves. The elimination only applies to cells outside the chain. Do not remove candidates from the chain cells — they need those values.
- Stale candidates. If you have not fully reduced candidates using simpler techniques first, you may falsely identify a cell as a bivalue cell when it actually has hidden candidates remaining.
Key Takeaways
Remote Pairs are a chain-based elimination technique that extends the logic of naked pairs across multiple cells and houses. Here is what to remember:
- Every cell in the chain must contain exactly the same two candidates and nothing else.
- Consecutive cells in the chain must share a row, column, or box to form a valid link.
- The chain must contain at least four cells for any elimination to occur.
- Values alternate along the chain, so odd-positioned cells hold one digit and even-positioned cells hold the other.
- Any cell outside the chain that can see both an odd-positioned and an even-positioned chain cell loses both candidates.
- Remote Pairs are a subset of XY-Chains and sit in the intermediate-to-advanced difficulty range.
Mastering Remote Pairs takes patience and practice, but the investment is absolutely worth it. Puzzles that once felt impenetrable will start to yield their secrets as you learn to trace these hidden chains across the grid. Keep your candidate lists precise, stay methodical in your chain-building, and enjoy the deeply satisfying click of logic that Remote Pairs deliver. Happy solving!