Rooted at 04:23, 20 January 2022

2022-01-20T04:23:43Z

Rooted: 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..."

2022-01-20T04:23:15Z

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..."

New page

In [[Sudoku-X]], the '''triangular connection''' [[solving technique]] can be stated as follows:
: Consider a [[digit]] '''X'''. Suppose a [[diagonal]] contains only two [[cell]]s that has '''X''' as a [[candidate]], call them '''A''' and '''B'''. Suppose another [[constraint]] contains only two [[cell]]s that has '''X''' as a [[candidate]], call them '''C''' and '''D'''. If '''A''' and '''C''' are [[peer]]s, then we can [[eliminate]] '''X''' from any cell that is [[see]]n 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 [[cluster]]s, or by using the following [[chain]]:
(X): B = A - C = D

== See Also ==
* [[Crossover]]
* [[Double Crossover]]

{{example}}

[[Category:Solving Techniques]]
[[Category:Sudoku-X]]

@@ Line 10: / Line 10: @@
 * [[Crossover]]
 * [[Double Crossover]]
 [[Category:Solving Techniques]]
 [[Category:Sudoku-X]]

Triangular Connection - Revision history

Rooted at 04:23, 20 January 2022

Rooted: 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..."