Advanced · Sudoku Pro
Skyscraper: two strong links, one safe elimination
Connect two row pairs through a shared column and prove that at least one distant tail holds the digit.
Partial candidate illustrations, not complete solved Sudoku boards. Verify candidate restrictions on a real grid before eliminating.
1. Start with exact pairs
Choose a digit, here 5. Suppose row 2 permits it only at r2c2 and r2c7, while row 7 permits it only at r7c2 and r7c8. Each pair is a strong link: one of its two candidates must contain 5. The shared column 2 prevents r2c2 and r7c2 from both being 5.
2. Follow the two cases
If r2c2 is 5, r7c2 cannot be 5, forcing r7c8 to be 5. If r2c2 is not 5, the row-2 pair forces r2c7 to be 5. Thus in all cases at least one of the two opposite tails—r2c7 or r7c8—contains digit 5.
3. Find a cell seeing both tails
The candidate at r3c8 sees r2c7 through the top-right 3×3 box and sees r7c8 through column 8. Whichever tail is 5, r3c8 cannot be 5. Eliminate candidate 5 there, if it was present. This is not a placement of either tail.
4. Check before using it
Verify the row-2 and row-7 candidate pairs are complete for digit 5. Confirm the two base cells really share column 2 and the target sees each tail by a valid row, column or box. If either source row has a third possible 5, the claimed strong link fails.
Check your understanding
Can you confidently place 5 at r2c7 after the Skyscraper elimination?
Open the explained answer
Not yet. The pattern proves that r2c7 OR r7c8 is 5, not which one. Its safe immediate consequence is removing 5 from r3c8.
This self-check requires no account and sends no answers to a server.
Deeper practical examples and reasoning
A Skyscraper is built from two genuine strong links for the same digit, usually in parallel rows or columns. Confirm both source links before any elimination. A target may lose that digit only if it sees both relevant outer endpoints; a visually similar arrangement is not enough.
Understand two strong links without guessing
A Skyscraper pattern uses one candidate digit and two source rows or columns, each with only two possible placements for that digit. If two rows share a possible column at one end while their other ends lie in different columns, the strong-link relationships can establish that at least one of the free ends must contain that digit. You then eliminate the digit from a cell that sees both free ends. This is a deduction about a chain of alternatives, not an assignment of the digit to the more visually prominent tower.
Why the target must see both endpoints
A target cell sharing a unit with only one free endpoint is not necessarily excluded: the other endpoint may be false while the first is true, or vice versa. To remove a candidate regardless of which alternative holds, the target must be incompatible with either possibility. Map row, column and box visibility explicitly, and verify that each source strong link really has exactly two candidate positions. A third position ruins the stated two-way implication.