Keith has written an
Introduction to Unique Rectangles. Here's a shot at all of the UR options based on Myth's nomenclature. Because the descriptions of the different types are important, I've added some additional labeling which isn't strictly necessary, for example the "X" in UR2X/1SL to distinguish where the strong link is located. In addition, "Type x" refer to the historical typing definitions.
UR+1 (Type 1): one UR cell with extra candidates => "ab" can be removed from "abX"
- Code: Select all
ab ab
ab abX
UR+2: two UR cells with extra candidate(s)
--- UR+2x (Type 2/2b): two cells with the same one extra candidate in a line => "x" can be removed from all cells common to the "abx"
- Code: Select all
ab ab
abx abx
--- UR+2d (Type 5): two cells with the extra candidate diagonal to each other => "x" can be removed from all cells common to the "abx" (given the rightmost "abx" and "ab" share a box, then at the "*")
- Code: Select all
* * ab | abx
abx | ab * *
--- UR+2X (Type 3/3b): two cells with one or more, not necessarily equivalent, extra candidates => treat "abX" as "X+Y" and "abY" as "abX+Y" and perform naked and hidden set reductions in the unit(s) containing these cells except for these cells.
- Code: Select all
ab ab
abX abY
--- UR+2D: two cells with extra candidates diagonal to each other such that "X+Y"="xy" and a naked "xy" common the "abX" and "abY" => eliminate "xy" from the cell common to all three (given "abX" and the rightmost "ab" share a box then at the "*")
- Code: Select all
ab | abX
abY | ab xy *
UR+2/1SL: two UR cells with extra candidates, strong link between two cells
--- UR+2X/1SL (Type 4): link between both cells with extra candidates, both cells with extra candidates in a line which forms an X-wing => X-wing eliminations if not previously performed (a strong link on "a" removes "a" in cells common to the rightmost "ab" and "abX" and "a" in cells comon to the leftmost "ab" and "abY"), and "b" from "abX" and "abY"
- Code: Select all
ab ab
a
abX-----abY
--- UR+2B/1SL: link between one cell with extra candidates and one bivalue cell, both cells with extra candidates in a line => a strong link on "a" removes "b" from "abY" - repeat for each strong link
- Code: Select all
ab ab
|
|a
|
abX abY
--- UR+2D/1SL: cells with extra candidates diagonal to each other => strong link on "a" removes "a" from "abY" - repeat for each strong link
- Code: Select all
ab abY
|
|a
|
abX ab
UR+3: three UR cells with extra candidate(s)
--- UR+3x: three cells with the same one extra candidate => "x" can be removed from all cells common to the "abx" (given the rightmost "abx" share a box, then at the "*")
- Code: Select all
ab | abx
abx | abx * *
--- UR+3X: three cells with extra candidates diagonal to each other such that "X+Y+Z"="xy" and a naked "xy" common the "abX", "abY", and "abZ" => eliminate "xy" from the cell common to all four (given "abX" and "abZ" share a box then at the "*")
- Code: Select all
ab | abX
abY | abZ xy *
UR+3/1SL: two or three UR cells with extra candidates (Z is optional), plus one strong link and at least one extra cell
--- UR+3x/1SL: "Y" is a single candidate "y", the extra cell "(ab)y" can include "a", and/or can include "b" if it shares a house with "abX" => "b" can be removed from "abX". Similarly, the extra cell "(ab)y" can include "b", and/or can include "a" if it shares a house with "abX" => "b" can be removed from "ab(Z)".
- Code: Select all
ab abX
|
|a
|
aby ab(Z) (ab)y
--- UR+3X/1SL: includes the extra cell "(ab)U..." such that "U" is a locked set which includes "Y", "abY" is seen by all of the cells of "(ab)U..." which contain elements of "Y", "(ab)U..." can contain "a", and "(ab)U..." can contain "b" if all of its cells which contain "b" are seen by "abX" => "b" can be removed from "abX". Similarly, "(ab)U..." can contain "b", and "(ab)U..." can contain "a" if all of its cells which contain "b" are seen by "abX" => "b" can be removed from "ab(Z)".
- Code: Select all
ab abX
|
|a
|
abY ab(Z) (ab)U...
UR+3/2SL: three UR cells with extra candidates, plus two strong links, at most one of which includes the bivalue cell
--- UR+3X/2SL: both strong links share a node, do not include the bivalue cell and have different labels which forms a continuous nice loop => strong links as shown remove "a" in cells common to "ab" and "abY", "b" in cells comon to "ab" and "abX", and "Z" in "abZ" which reduces the problem to UR+2D/1SL so "b" can be removed from "abY" and "a" can be removed from "abX"
- Code: Select all
ab abX
|
b|
a |
abY-----abZ
--- UR+3C/2SL: both strong links share a node, do not include the bivalue cell and have equal labels => "b" can be removed from "abZ"
- Code: Select all
ab abX
|
a|
a |
abY-----abZ
--- UR+3N/2SL: both strong links share a node, have different labels and one link includes the bivalue cell => "a" can be removed from "abY", and treat "abY" as "Y+Z" and "abZ" as "abY+Z" and perform naked and hidden set reductions in the unit(s) containing these cells except for these cells.
- Code: Select all
ab-----abX
a |
b|
|
abY abZ
--- UR+3U/2SL: the strong links are disjoint with different labels => "a" can be removed from "abY"
- Code: Select all
ab-----abX
a
b
abY-----abZ
--- UR+3E/2SL: the strong links are disjoint with the same labels which forms an X-wing => X-wing eliminations if not previously performed (strong links as shown remove "a" from cells common to "ab" and "abY" and "a" in cells common to "abX" and "abZ"), and "b" from "abZ"
- Code: Select all
ab-----abX
a
a
abY-----abZ
UR+4/1SL: four UR cells with extra candidates, plus one strong link and at least two extra cells
--- UR+4x/1SL: "Y" and "Z" are single candidates "y" and "z", the extra cell "(ab)y" can contain "a" if it shares a house with "abW" and/or "b" if it shares a house with "abX", similarly the extra cell "(ab)z" can contain "a" if it shares a house with "abW" and/or "b" if it shares a house with "abX" => "b" can be removed from "abX".
- Code: Select all
abW-----abX
a
aby abz (ab)y (ab)z
--- UR+4X/1SL: includes the extra cell(s) "(ab)U..." such that "U" is a locked set which includes "Y", "abY" is seen by all of the cells of "(ab)U..." which contain elements of "Y", and "(ab)U..." can contain "a" if all of its cells which contain "a" are seen by "abW" and/or can contain "b" if all of its cells which contain "b" are seen by "abX" and similarly for "(ab)V..." where "V" is a locked set which includes "Z" => "b" can be removed from "abX".
- Code: Select all
abW-----abX
a
abY abZ (ab)U... (ab)V...
UR+4/2SL: three or four UR cells with extra candidates (Z is optional), plus two strong link and at least one extra cell
--- UR+4x/2SL: "Y" is a single candidate "y", the extra cell "(ab)y" can include "a", and/or can include "b" if it shares a house with "abX" => "b" can be removed from "abX".
- Code: Select all
abW-----abX
a |
|a
|
aby ab(Z) (ab)y
--- UR+4X/2SL: includes the extra cell "(ab)U..." such that "U" is a locked set which includes "Y", "abY" is seen by all of the cells of "(ab)U..." which contain elements of "Y", "(ab)U..." can contain "a", and "(ab)U..." can contain "b" if all of its cells which contain "b" are seen by "abX" => "b" can be removed from "abX".
- Code: Select all
abW-----abX
a |
|a
|
abY ab(Z) (ab)U...
UR+4/3SL: all four UR cells with extra candidates, plus three strong links
--- UR+4X/3SL: the links with equal labels are disjoint which forms a continuous nice loop => X-wing eliminations if not previously performed ("a" can be removed from cells common to "abX" and "abY" and cells common to "abZ" and "abW"), "Z" can be removed from "abZ", "W" can be removed from "abW" which reduces the problem to UR+2B/1SL so "b" can be removed from "abX" and "abY"
- Code: Select all
abX-----abZ
a |
b|
a |
abY-----abW
--- UR+4C/3SL: the links with equal labels share a node => "b" can be removed from "abZ"
- Code: Select all
abX-----abZ
a |
a|
b |
abY-----abW
[ronk-moderator 20110330
edit: See addendum
here.]