keith wrote:Question 2:
Havard wrote:Type 3: UR with two extra candidates in addition to the UR-pair. Can create a locked set with other cells, as long as all the UR-extra-candidates-cells are concidered one cell in the locked set, and of course all cells in the locked set can see eachother...
Would it not be more accurate to say that the UR-pair is one cell in the locked set? Since the UR-pair can occupy only one of two cells in the UR. Then, the locked set of 2+N possibilities will only occupy 1+N cells?
To say it another way: The extra candidates will be fully represented in the solution of the locked set. Only one (of two) of the UR candidates will be there.
Thanks to all,
Keith
Hi Keith!
I guess I was thinking in very general terms, and that it is possible for the type 3 to have extra candidates in three cells:
- Code: Select all
*
xy
abxy---abxy
| |
| |
| |
ab-----abxy
- Code: Select all
. . . | . . * | . . .
. . . | . . xy| . . .
. . . | xy--xy| . . .
------+-|---|-+------
. . . | | . | | . . .
. . . |ab---xy| . . .
. . . | . . . | . . .
------+-------+------
. . . | . . . | . . .
. . . | . . . | . . .
. . . | . . . | . . .
As you can see from these illustrations, the * can not be either x or y, because that would with the xy cell eliminate all xy's in the UR, and make a deadly pattern! As you can see, this would only apply for this special case, and would only ever be able to eliminate in one cell, but I still think it is worth mentioning, and that is why I generalised my description of the type 3 to not just include two cells
havard