Ruud at 12:23, 30 October 2021

2021-10-30T12:23:57Z

← Older revision		Revision as of 12:23, 30 October 2021
Line 15:		Line 15:

	The XY-Cycle does not need to have an even number of cells, as long as the last cell can see the first and shares a candidate with it.		The XY-Cycle does not need to have an even number of cells, as long as the last cell can see the first and shares a candidate with it.

			[[Category:Solving Techniques]]

127.0.0.1: Created page with "An '''XY-Cycle''' or '''XY-Ring''' is a ''Continuous Nice Loop'' limited to cells with only 2 candidates each. These do not need to be candidates for the same 2 [..."

2021-10-29T07:44:05Z

Created page with "An '''XY-Cycle''' or '''XY-Ring''' is a ''Continuous Nice Loop'' limited to cells with only 2 candidates each. These do not need to be candidates for the same 2 [..."

New page

An '''XY-Cycle''' or '''XY-Ring''' is a ''Continuous [[Nice Loop]]'' limited to [[cell]]s with only 2 [[candidate]]s each. These do not need to be candidates for the same 2 [[digit]]s as in [[Remote Pairs]], but 2 adjacent cells in the loop must share one of the candidates for the loop to be correct.

The cycles are similar to [[XY-Chain]]s.

rncx(a,b) - rncy(b,c) - rmcy(c,d) - rmcx(d,a) - rncx

In [[Nice Loop]] notation, this would be:

-[rncx]-b-[rncy]-c-[rmcy]-d-[rmcx]-a
This XY-Cycle [[eliminate]]s the following candidates:
# All other candidates for digit b in row n
# All other candidates for digit c in column y
# All other candidates for digit d in row m
# All other candidates for digit a in column x

The XY-Cycle does not need to have an even number of cells, as long as the last cell can see the first and shares a candidate with it.

XY-Cycle - Revision history

Ruud at 12:23, 30 October 2021

127.0.0.1: Created page with "An '''XY-Cycle''' or '''XY-Ring''' is a ''Continuous Nice Loop'' limited to cells with only 2 candidates each. These do not need to be candidates for the same 2 [..."