Skyscraper

A Skyscraper is the parallel-house form of the two-node X-Chain. For one digit, two row nodes or two column nodes form (A=B)-(C=D): the equals signs are strong inferences and the dash is a weak inference across the perpendicular house. The chain proves A OR D, allowing eliminations from candidates that see both endpoints.

What is a Skyscraper?

A Skyscraper uses two same-digit bilocation nodes in parallel rows, or in parallel columns. Write it as (A=B)-(C=D). Each base house has exactly two positions for the digit, giving the two strong links (XOR) A=B and C=D. The connected candidates B and C share a perpendicular house and cannot both be true, giving the weak inference (NAND) B-C. This is also the AIC representation of two Siamese Sashimi X-Wings.

Walkthrough example

A walkthrough of one Skyscraper written as (A=B)-(C=D): two parallel-house strong inferences joined by one perpendicular-house weak inference.

Step 1

Consider the two-node X-Chain for 8 in row 1 and row 6.

Sudoku grid showing step 1 of the Skyscraper walkthrough, with the relevant candidates and cells highlighted.

Step 2

Write the chain as (D1=B1)-(B6=F6). Each equals sign is a strong link (XOR): in row 1, exactly one of D1 and B1 contains 8; in row 6, exactly one of B6 and F6 contains 8. The dash is a weak inference (NAND): B1 and B6 see each other in this column, so they cannot both contain 8. If D1 is false, B1 is true, B6 is false, and F6 is true. Therefore the endpoints satisfy D1 OR F6: at least one contains 8, possibly both.

Sudoku grid showing step 2 of the Skyscraper walkthrough, with the relevant candidates and cells highlighted.

Step 3

This is the Type 1 same-digit elimination: because D1 OR F6 is proved for 8, remove 8 from every candidate that sees both endpoints.

Sudoku grid after the Skyscraper deduction, with the justified placement or eliminations highlighted.

The parallel-house signature (A=B)-(C=D) proves the inclusive endpoint relation A OR D through two strong links (XOR) and one weak inference (NAND). That AIC relation, rather than the visual roof shape, justifies removing the digit from a candidate that sees both endpoints. This is the Type 1 same-digit elimination. You can start a free Sudoku game to practise with the current candidate state visible.

How to spot it

For one digit, find two rows with exactly two candidate positions each, or use the transposed column form. Verify that one side of each strong-inference node shares the same perpendicular house; that pair supplies the weak inference. The other sides are endpoints A and D. Remove the digit only from a target that sees both endpoints.

The logic

If A is false, B is true because A=B is a strong link. Since B-C is a weak inference, C is false; C=D then makes D true. Therefore A OR D is true, possibly both. Any same-digit candidate seeing both endpoints can be removed. This is the Type 1 same-digit elimination. Swapping rows and columns leaves the proof unchanged.