Skip to content
VEYRAPLAYPlay
Module 6 · Links & ChainsLesson 26 of 28

W-Wing

Use an external Strong Link to connect two matching bivalue cells and eliminate their other candidate.

Outcome

You can connect two matching bivalue cells through a valid Strong Link, prove that one wing must contain the elimination digit, and reject false W-Wings with the wrong link or visibility.

Intro copy

Two remote {X,Y} cells are not automatically related.

W-Wing gives them a logical bridge:

a Strong Link on one candidate.

Step 1 — Start with two matching wings

Show:

Wing A {5,9}
Wing B {5,9}

Prompt:

Do these form a Naked Pair?

If they do not share a unit:

No.

Prompt:

What would we need to connect them logically?

Reveal:

A Strong Link on 5 or 9.

Show a conjugate pair on 9.

One link endpoint sees wing A.

The other sees wing B.

Prompt:

Which candidate is acting as the link digit?

Correct: 9.

Step 3 — Prove both cases

Wing A cannot be 9 → wing A = 5.

Wing B cannot be 9 → wing B = 5.

Conclusion:

One wing is always 5.

Step 4 — Eliminate from common peers

Show candidate 5 targets:

  • sees both wings;
  • sees only A;
  • sees only B.

Learner removes only the common-peer target.

Feedback:

The Strong Link is on 9, so 5 is the elimination digit.

Step 5 — Guided board

Learner:

  1. finds repeated bivalue signature;
  2. chooses one candidate as potential link digit;
  3. finds conjugate pair;
  4. matches opposite endpoints to wings;
  5. proves both cases;
  6. removes the other candidate.

Show a proposed W-Wing where the “link digit” has three positions in the source unit.

Prompt:

Valid W-Wing?

No.

Feedback:

The bridge is only Weak. If one endpoint is false, the other is not forced true.

Step 7 — Simpler Pair comparison

Show two {2,8} wings that actually share a box.

Prompt:

Which explanation should you try first?

Correct:

Naked Pair.

This reinforces the simplest-valid-proof rule.

Practice

Include:

  • row/column Strong Links;
  • box Strong Link;
  • invalid Weak-only bridge;
  • invalid common-peer target;
  • Naked Pair decoy.

Hint ladder

  1. “Look for matching bivalue cells.”
  2. “Choose one shared digit.”
  3. “Can that digit connect the wing regions through a Strong Link?”
  4. “One link endpoint must be true.”
  5. “Which wing candidate is therefore guaranteed somewhere?”
  6. Highlight common-peer eliminations.

Completion

Three valid W-Wings plus three false/simpler-structure classifications.

Next

Unique Rectangles

The next lesson changes logical premise: uniqueness techniques rely on a verified one-solution puzzle.

Reference

Read W-Wing for the full Strong-Link proof and Chain interpretation.