Difference between revisions of "Triangular Connection"
From Sudopedia
Jump to navigationJump to search (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...") |
|||
| Line 10: | Line 10: | ||
* [[Crossover]] | * [[Crossover]] | ||
* [[Double Crossover]] | * [[Double Crossover]] | ||
| − | |||
| − | |||
[[Category:Solving Techniques]] | [[Category:Solving Techniques]] | ||
[[Category:Sudoku-X]] | [[Category:Sudoku-X]] | ||
Latest revision as of 04:23, 20 January 2022
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
