Triangular Connection

From Sudopedia
Revision as of 04:23, 20 January 2022 by Rooted (talk | contribs) (Created page with "In Sudoku-X, the '''triangular connection''' solving technique can be stated as follows: : Consider a digit '''X'''. Suppose a diagonal contains only two cel...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

In Sudoku-X, the triangular connection solving technique can be stated as follows:

Consider a digit X. Suppose a diagonal contains only two cells that has X as a candidate, call them A and B. Suppose another constraint contains only two cells that has X as a candidate, call them C and D. If A and C are peers, then we can eliminate X from any cell that is seen by both B and D.

Double crossover is a special case of Triangular Connection, where the constraint containing C and D is the other diagonal.

Like the Double Crossover technique, the triangular connection technique can be replicated using Color Wing with two clusters, or by using the following chain:

(X): B = A - C = D

See Also

Template:Example