Pairs are the first genuinely deductive technique in Sudoku. They don't place a digit directly — they remove candidates elsewhere, and the removals create the singles that let you carry on.
If two cells in the same unit have identical candidate lists of exactly two digits, those two cells will take those two digits between them. You don't know which goes where. It doesn't matter. Both are spoken for, so neither digit can appear anywhere else in that unit.
In the row above, two cells both read 4 and 7. One will be the 4 and the other the 7 — that's forced regardless of order. So every other cell in the row loses 4 and 7 from its candidates. Here that resolves three cells at once: one drops to a single 1, one to a single 9, one to a single 2.
This is the pattern to internalise: a pair rarely does anything on its own, and then does a great deal one move later.
12, 23,
13 is a valid triple.The camouflaged version, and the harder one to spot. If two digits appear as candidates in only two cells of a unit, then those two cells must hold those two digits — and every other candidate in those two cells can be deleted.
Look at the box above for 2s and 6s. Both digits appear in only two cells. The box needs a 2 somewhere and a 6 somewhere, and there are only two homes for them, so those cells are claimed. The 1, 5 and 8 written in them are impossible and come out.
Note the direction of the deduction. A naked pair clears candidates from other cells. A hidden pair clears candidates from the pair's own cells. Beginners often learn naked pairs, decide pairs are handled, and never pick up the hidden version — which is the one that unlocks Hard puzzles.
Every hidden pair is a naked pair in disguise, and vice versa. If a unit has five empty cells and two of them are locked to 2 and 6, the other three are locked to the remaining three digits — a naked triple. Which one you notice first is a matter of what your eye is trained on, not which is really there.
When singles have dried up, a reliable order is:
Single-based solving is fairly forgiving: a stale pencil mark usually just hides a deduction. Pair-based solving is not. A candidate you forgot to erase can manufacture a pair that doesn't exist, and acting on it will delete candidates that were genuinely needed. The grid stays consistent for a long time before the contradiction appears, and by then it's unrecoverable without a restart.
Before you trust a pair, re-derive both cells' candidates from scratch. It takes ten seconds and saves the puzzle.