An X-Chain is an alternating inference chain that follows one candidate digit only.
A standard eliminative X-Chain:
- starts with a Strong Link;
- alternates Strong and Weak relationships;
- ends with a Strong Link.
That structure proves:
At least one chain endpoint must contain the digit.
So the digit can be removed from any candidate that sees both endpoints.
Quick pattern
Conceptually:
A = B - C = D - E = F=Strong;-Weak.
If A is false:
- B true;
- C false;
- D true;
- E false;
- F true.
If the chain is valid in reverse, F false forces A true.
So one of A/F is true.
Why the chain starts and ends Strong
The endpoint conclusion needs this property:
endpoint false → opposite endpoint true.
At the first endpoint, the initial Strong Link turns false into true.
Alternation carries the state across the chain.
At the far end, the Strong-ending structure supports the reverse implication.
That is what gives the useful “one endpoint must be true” conclusion.
Step-by-step example
Strong and Weak sources in an X-Chain
Because one digit is fixed:
Strong Links
Usually:
- conjugate pairs in rows;
- conjugate pairs in columns;
- conjugate pairs in boxes.
Weak Links
Same-digit candidate positions that see each other.
A Strong Link may also serve in a Weak role because conjugate-pair endpoints cannot both be true.
Understanding that flexibility makes some chains easier to construct.
X-Chain vs Skyscraper / Two-String Kite
A four-candidate X-Chain can often be recognized as a named Turbot-style pattern.
Skyscraper
Two parallel conjugate pairs with one aligned side.
Two-String Kite
One row conjugate pair + one column conjugate pair connected through a box.
The names are shortcuts.
X-Chain is the general inference language.
X-Chain vs Simple Coloring
Coloring
Build a larger connected network of conjugate pairs and use two-color contradictions.
X-Chain
Choose one specific alternating path that reaches useful endpoints.
A Coloring component may contain many possible X-Chains.
The two techniques are complementary search approaches.
How to find X-Chains without drawing everything
- Filter one candidate digit.
- Mark Strong Links.
- Pick a promising endpoint.
- Ask which Weak connections lead into another Strong Link.
- Continue only while the chain remains short enough to verify.
- Stop when the far endpoint creates a common-peer elimination.
Do not extend a chain simply because you can.
Longer is not better.
A chain can be valid but useless
Suppose A and F are proven as endpoints, but:
- no candidate sees both;
- no other contradiction or placement follows.
Then the chain has no current solving effect.
Return to the board.
The objective is a deduction, not a chain collection.
Common mistakes
Changing candidate digit inside the chain
Then it is not an X-Chain.
Using two Strong or two Weak inference roles incorrectly without validating the intermediate state
Check propagation, not just line style.
Ending with the wrong endpoint structure
The standard common-peer elimination needs the endpoint truth guarantee.
Eliminating from a target seeing only one endpoint
Invalid.
Building very long chains before mastering short ones
Recognition and verification become harder quickly.
Recognition drill
With digit 7 filtered:
- mark conjugate pairs;
- choose two Strong-Link segments;
- ask whether one endpoint from each segment sees the other;
- trace the resulting short chain.
This deliberately begins near the Skyscraper/Kite level before expanding.
FAQ
Does X-Chain use only one digit?
Yes.
Is Skyscraper an X-Chain?
It can be represented as a short X-Chain.
Does every X-Chain eliminate from common peers?
The endpoint pattern taught here does. More general chain/AIC structures can produce other conclusions.
Is X-Chain the same as Coloring?
No, although both operate on one candidate digit and Strong-Link structures.
What to learn next
Move to XY-Chain, where Strong Links live inside bivalue cells and the candidate value changes along the path.