Rooted: Created page with "In Sudoku-X, the '''double crossover''' solving technique can be stated as follows: : Consider a digit '''X'''. Suppose the leading diagonal contains only two..."

2022-01-20T04:24:21Z

Created page with "In Sudoku-X, the '''double crossover''' solving technique can be stated as follows: : Consider a digit '''X'''. Suppose the leading diagonal contains only two..."

New page

In [[Sudoku-X]], the '''double crossover''' [[solving technique]] can be stated as follows:
: Consider a [[digit]] '''X'''. Suppose the leading [[diagonal]] contains only two [[cell]]s that has '''X''' as a [[candidate]], call them '''A''' and '''B'''. Suppose the non-leading [[diagonal]] 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'''.

The double crossover technique can be replicated using [[Color Wing]] with two [[cluster]]s, or by using the following [[chain]]:
(X): B = A - C = D

Double crossover is a special case of [[Triangular Connection]].

== See Also ==
* [[Crossover]]
* [[Triangular Connection]]

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

Double Crossover - Revision history

Rooted: Created page with "In Sudoku-X, the '''double crossover''' solving technique can be stated as follows: : Consider a digit '''X'''. Suppose the leading diagonal contains only two..."