If you have worked your way through the basics of Sudoku — naked singles, hidden singles, and even the ever-reliable naked pairs — you may have started to encounter grids that simply refuse to yield to those familiar tools. The cells sit there, stubbornly holding on to two candidates each, and no matter how many times you scan the rows, columns, and boxes, nothing budges. This is exactly the moment when a chain-based technique called Remote Pairs comes to the rescue. It is one of those strategies that feels almost magical the first time it works, yet once you understand the logic behind it, it becomes a dependable part of your advanced solving toolkit.
What Are Remote Pairs and Why Do They Work?
A Remote Pair is built on a very simple foundation: the bilocation property of a candidate. When a cell contains exactly two candidates — say, the digits 4 and 7 — one of those digits must be the correct answer. There is no third option. This binary nature is what makes chains of such cells so powerful.
A Remote Pair chain is a sequence of cells, each containing the same two candidates (let’s keep using 4 and 7 as our example), where each consecutive pair of cells in the chain can “see” each other — meaning they share a row, column, or box. The chain must have an odd number of links, which means it must contain an even number of cells (at least four).
Here is the key insight: as you travel along the chain, the values alternate. If the first cell in the chain holds a 4, the second must hold a 7, the third a 4, the fourth a 7, and so on. Because the chain alternates perfectly, any cell that can see both the first and the last cell of the chain will see a 4 in one of them and a 7 in the other — no matter which way the chain resolves. That means neither 4 nor 7 can appear in that outside cell. You can safely eliminate both candidates from it.
This is the core logical argument: the elimination is valid because there is no possible outcome in which the external cell could survive with either candidate intact.
Setting Up a Remote Pairs Chain: Step by Step
Before you can apply Remote Pairs, you need to identify the right conditions. Here is a reliable process for spotting and verifying a Remote Pairs opportunity:
- Pencil in all candidates. Remote Pairs require a fully annotated grid. Make sure every empty cell shows all remaining possible digits. Skipping this step makes spotting the chain almost impossible.
- Identify all bivalue cells with the same two candidates. Scan the grid for every cell that contains exactly the same pair of digits — in our example, every cell showing only {4, 7}. Circle or highlight them.
- Check connectivity. Look for chains among those highlighted cells. Two cells are connected if they share a row, column, or 3×3 box. Build a chain by linking connected cells one after another.
- Count the cells. A valid Remote Pairs chain must contain an even number of cells (4, 6, 8, and so on). An odd-count chain will not alternate correctly and cannot be used for elimination.
- Find the victims. Look for any cell that can see both the first and the last cell of your chain simultaneously (sharing a row, column, or box with each). Any such cell that still holds 4 or 7 as a candidate can have those digits eliminated.
It sounds methodical, because it is. Remote Pairs is not an instinctive technique — it rewards patience and careful notation. But the payoff can be enormous, sometimes unlocking a chain of simple deductions that solves the rest of the puzzle in minutes.
A Worked Example: Walking Through a Real Chain
Let’s make this concrete. Imagine the following scenario in a partially solved Sudoku grid. We have identified four cells, each containing only the candidates {3, 8}:
- Cell A — Row 1, Column 2
- Cell B — Row 1, Column 7 (same row as A, so A and B are connected)
- Cell C — Row 5, Column 7 (same column as B, so B and C are connected)
- Cell D — Row 5, Column 4 (same row as C, so C and D are connected)
Our chain runs: A → B → C → D. That is four cells, connected in sequence — a valid Remote Pairs chain.
Now let us trace the alternation. Suppose Cell A contains a 3. Then:
- Cell B must contain an 8 (it sees A and cannot also be 3).
- Cell C must contain a 3 (it sees B and cannot also be 8).
- Cell D must contain an 8 (it sees C and cannot also be 3).
Alternatively, suppose Cell A contains an 8. Then:
- Cell B must contain a 3.
- Cell C must contain an 8.
- Cell D must contain a 3.
In Outcome 1, Cell A = 3 and Cell D = 8. In Outcome 2, Cell A = 8 and Cell D = 3. Either way, Cell A and Cell D together hold one 3 and one 8. Any cell that can see both Cell A (Row 1, Column 2) and Cell D (Row 5, Column 4) will be affected by this. In this grid, imagine there is a cell at Row 1, Column 4 — it shares Row 1 with Cell A and Column 4 with Cell D. That cell sees both ends of the chain. Regardless of which outcome is correct, the digit 3 is in either A or D (both visible to our target cell), and the digit 8 is in either A or D (both visible). So the target cell can never be a 3 and can never be an 8. We eliminate both candidates from it immediately.
This is the power of the technique in action. With a four-cell chain, we turned a seemingly unsolvable candidate tangle into a clean elimination — often the breakthrough a difficult puzzle needs.
Common Mistakes and How to Avoid Them
Remote Pairs is a precise technique, and small errors in application can lead to wrong eliminations that ruin the puzzle. Watch out for these frequent pitfalls:
- Using chains with an odd number of cells. A three-cell or five-cell chain will not produce valid Remote Pairs eliminations. The alternation logic only holds when the count is even. If your chain has an odd number of cells, look for a way to extend it — or set it aside.
- Confusing “sees” with “is close to.” Two cells are connected only if they share a row, column, or 3×3 box. Being in adjacent boxes or diagonally touching does not count. Always double-check that each link in the chain is a genuine shared unit.
- Including cells with more than two candidates. Every cell in the chain must contain only the two paired digits. If a cell in your chain has even one extra candidate, it breaks the bilocation property and the entire logic collapses.
- Eliminating from the wrong cells. Only cells that simultaneously see both the first and last cell of the chain are eligible for elimination. A cell that sees only one end of the chain is unaffected.
- Not updating candidates after elimination. Once you have made an elimination, go back through the grid immediately. The removal of a candidate can create new naked singles, hidden singles, or even new Remote Pairs opportunities that were not visible before.
How Remote Pairs Relates to Other Advanced Techniques
Understanding Remote Pairs becomes even more rewarding when you see how it fits within the broader landscape of advanced Sudoku strategies. At its heart, Remote Pairs is a specific application of X-Chains — a family of alternating inference chains (AICs) that use the bilocal property of candidates to force eliminations. If you go on to study X-Cycles, XY-Chains, or full AICs, you will find that the alternating logic you learned with Remote Pairs is the exact same engine powering those more complex techniques.
Remote Pairs also has a close relationship with the simpler naked pairs strategy. A classic naked pair occurs when two cells in the same unit each contain only the same two candidates — you eliminate those candidates from the rest of the unit. Remote Pairs extends this idea across multiple units, using a chain to connect two “endpoints” and then leveraging their combined effect on external cells. Think of it as a long-distance naked pair that reaches across the grid.
For solvers who enjoy the coloring technique (also called Simple Coloring or Conjugate Pairs), Remote Pairs will feel familiar. Coloring assigns two colors to cells based on which value they might hold, then looks for color conflicts. Remote Pairs is essentially coloring applied specifically to bivalue cells sharing the same two candidates — a focused, structured version of the same principle.
Knowing where Remote Pairs sits in the hierarchy helps you decide when to use it. It is harder than naked pairs and hidden singles but generally easier to spot and verify than full XY-Chains or Swordfish patterns. When your grid is stuck and you have exhausted the basics, Remote Pairs is often the right next step to try before reaching for the heavy artillery.
Key Takeaways
- Remote Pairs uses a chain of cells that each contain the same two candidates, connected by shared rows, columns, or boxes.
- The chain must have an even number of cells (minimum four) to create the alternating pattern that enables safe eliminations.
- Any cell that can see both the first and the last cell of the chain can have both shared candidates eliminated from it.
- Every cell in the chain must be a bivalue cell — containing only and exactly those two candidates, with no extras.
- Remote Pairs is closely related to X-Chains, coloring techniques, and XY-Chains, making it an excellent stepping stone to mastering more advanced Sudoku logic.
- Always fully annotate your grid with pencil marks before attempting to find Remote Pairs — visibility is everything with chain techniques.
Mastering Remote Pairs takes a little practice, but every puzzle you use it on deepens your understanding of how Sudoku logic truly works at an advanced level. The next time you find yourself staring at a grid full of stubborn bivalue cells, take a breath, highlight all the cells sharing the same candidate pair, and start tracing connections. Your chain could be closer than you think — and the satisfying click of a Remote Pairs elimination is one of the best feelings Sudoku has to offer. Keep solving, keep exploring, and enjoy the journey through the puzzle.