Sudoku Chains

A Sudoku Chain is a sequence of forced implications between candidate states.

For the current learning path, the most useful language is:

• Strong Link: false → true;
• Weak Link: true → false.

Alternate those inference roles and a state can travel across the grid:

false → true → false → true → ...

A useful chain ends with a conclusion:

• an endpoint must be true;
• a candidate must be false;
• an assumption creates a contradiction;
• or two possible starts lead to the same result.

The goal is not to build the longest chain possible.

It is to build the shortest chain that proves something useful.

A four-node chain

Suppose:

A = B - C = D

where:

• = represents a Strong Link;
• - represents a Weak Link.

Start with A false.

A false

Strong Link:

→ B true.

B true

Weak Link:

→ C false.

C false

Strong Link:

→ D true.

Therefore:

A false → D true.

If the chain structure is also valid in reverse:

D false → A true.

Then at least one endpoint A/D must be true.

Any candidate that conflicts with both endpoints can be eliminated.

Why Chains are not arbitrary guessing

A chain may begin with a temporary assumption:

Suppose A is false.

But every later state is forced by a valid link.

The assumption is not accepted as an answer.

It is used to prove a consequence.

This is the difference between unsupported trial and error and logical implication.

Named patterns are compressed Chains

Several Advanced techniques already fit chain logic.

Skyscraper

A short one-digit chain.

Two-String Kite

A short one-digit chain with a box Weak Link.

W-Wing

Two matching bivalue cells connected through a Strong Link.

XY-Wing

A short bivalue-cell chain.

Named patterns are useful because humans can spot them faster than arbitrary chains.

Chain language is useful because it explains why the patterns work and extends beyond fixed geometry.

Links inside and between cells

Inside a bivalue cell

{3,8}

3 and 8 are strongly linked:

• not 3 → 8;
• not 8 → 3.

Between peer cells

Two candidate 8s sharing a unit are weakly linked:

• first 8 true → second 8 false.

That alternation is the basis of XY-Chains.

One-digit Chains

An X-Chain uses one candidate digit only.

Strong Links usually come from conjugate pairs.

Weak Links come from candidate positions that see each other.

A standard endpoint X-Chain:

• starts Strong;
• ends Strong;
• proves one endpoint must be X;
• eliminates X from cells seeing both endpoints.

Bivalue-cell Chains

An XY-Chain uses bivalue cells.

Inside each cell:

• candidates are strongly linked.

Between consecutive cells:

• the shared candidate forms the weak connection.

The chain begins and ends on the same candidate value, allowing common-peer eliminations.

XY-Wing is the three-cell introductory form.

Chain notation

VeyraPlay should teach meaning before notation.

A simple visual notation can use:

• solid line = Strong;
• dashed line = Weak.

Text notation may later use:

A = B - C = D

The product should not require a learner to decode formal AIC notation before understanding the true/false propagation.

When is a chain useful?

A valid sequence of links is not automatically a solving move.

It needs a conclusion.

Useful endpoint pattern:

one endpoint must be true.

Useful contradiction pattern:

this assumption forces an impossible state.

Useful convergence pattern:

both possible starts force the same result.

If the chain ends without proving anything, it is logically interesting but not productive.

Chain vs Net

In a simple chain, each inference depends directly on the immediately previous state.

A Net branches or depends on multiple earlier branches.

VeyraPlay keeps the introductory Learn path linear:

• Strong;
• Weak;
• short Chain;
• X-Chain/XY-Chain concepts.

Forcing Nets belong much later.

From Chain concepts to specific techniques

Simple Coloring

A visual way to manage a network of same-digit Strong Links using two states.

X-Chain

A deliberate one-digit alternating path.

XY-Chain

A path through bivalue cells.

AIC

The more general alternating-inference framework.

Full AIC treatment belongs to a later Expert expansion.

How to learn Chains without getting overwhelmed

1. Master Strong vs Weak.
2. Trace four-node abstract chains.
3. See the same links on a Sudoku grid.
4. Revisit Skyscraper/Kite/W-Wing.
5. Learn short X-Chains.
6. Learn short XY-Chains.
7. Only then expand into formal AICs.

Common mistakes

Alternating line styles without checking the actual inference

The logical relationship matters more than the drawing.

Reading a Weak Link backward

False does not force the partner true unless a Strong Link also exists.

Building a chain with no conclusion

A chain should prove a move.

Jumping straight into formal notation

Notation compresses understanding; it does not create it.

Using an unnecessarily long chain

If a named short pattern or simpler deduction proves the same move, prefer that explanation.

FAQ

Are Chains always Expert Sudoku?

No. Some named short chains such as Skyscraper are approachable Advanced techniques.

Is XY-Wing a Chain?

It can be represented as a short XY-Chain.

What is an AIC?

An Alternating Inference Chain is a general framework that alternates Strong and Weak inferences.

Are Chains the same as guessing?

No. Every inference in the chain is forced; a temporary assumption is used as part of a proof.

What to learn next

Study Simple Coloring, X-Chain, and XY-Chain, then leave full AICs for the later Expert expansion.