Print Version Page Index
Solvers
Puzzles
Basic Strategies
Tough Strategies
Diabolical Strategies
Extreme Strategies
Deprecated Strategies
Str8ts
Other

Order Now!
Order Now!

# SK Loops

The reason SK Loops are in the 'diabolical' strategies and not the 'extreme' as this is quite a stand-out pattern. However, it was discovered (invented?) trying to solve the Easter Monster and it requires a crowded field of candidates, which is typical of the very hardest puzzles.

Credits first: I'm indebted to pjb or Phil from Sydney, Australia for his write up here and the many examples he's collected on his website here. The solver will find SK Loops for all Phil's types from the vanilla down to Type H, but not as yet "Related Loops". In my implementation I don't discern 'types' as I've generalized the detection. SK Loops are apparently a subset of something larger but I've not explored this yet.

I'm going to start, as Phil does, with the Easter Monster, since the pattern is nicely spread out and symmetrical. SK Loops are bi-directional continuous loops meaning that the loop can be started at any point and you can trace the links in either direction.

First find four solved or given cells spread over four boxes such that they make a rectangle. Phil distinguishes between givens (clues) and solved cells but I do not and I've not found a false positive because of this.

Shown in the diagram are four such numbers and surrounding them are eight 2-cell pairs containing Hidden Pairs
The pattern definition is then
• The loop requires 4 boxes in 2 bands and and 2 stacks, and 8 links, one link in each box, one link in each row and one link in each column.
• In each box the cell at the intersection of the row cells and column cells is a given.
• Loops can include single, double or triple links, as long as the sum of the links is less than or equal to 16.
• Of the 2 cells involved in a row or column within a box, one of the two can be solved, but not a given.
Since we have eight pairs of cells, sixteen numbers will be required to fill all those cells. The solver highlights candidates in green and blue. These are the alternative solutions. All sixteen cells will contain either the green numbers or the blue numbers, or exactly one green and one blue in each pair. (Sounds vague, but the first example here is an example of the later, as pointed out by Robert in the comments).

Now, the pattern definition requires sum of the links is less than or equal to 16. To see what we are counting, here is the formal definition of the loop

(27=38)B13- (38=16)B79- (16=39)AC8- (39=27)GJ8- (27=45)H79- (45=16)H13- (16=48)GJ2- (48=27)AC2-

The solver always starts at the top-left most given cell and the row and loops clockwise, so pair B13 starts. (Phil's starts in a different place in his documentation). B13 is Strongly Linked to B79 on the Hidden Pair {3,8}. Looking at all the links and counting the candidates in each pair we get
SK Loop Type 2-2-2-2-2-2-2-2-
and those numbers add up to 16.

Since we have identified the content of these sixteen cells as a Locked Set we can eliminate along the unit of alignment. So, since B13 contains a blue {3,8} and B79 contains a green {3,8} and the solution will be one or the other, so we can remove 3 and 8 from B5 and B6.

This SK Loop alternates Triple and Single links instead of the classic doubles all round. This makes the type 3-1-3-1-3-1-3-1- but those numbers still add up to 16.

Take a moment to trace some of the links in the diagram and compare to the definition of the loop:
(579=8)A23- (8=469)A78- (469=2)BC9- (2=457)GH9- (457=1)J78- (1=469)J23- (469=3)GH1- (3=579)BC1-

Lastly we can consider the fourth element of the SK Loop definition, the cases where one of the two cells in a pair is a solved cell. Phil states this cannot be a given, but I am still searching for a counter example and the solver does not distinguish.

The type for this loop, 2-2-1-2-2-2-1-2- now adds up to only 14, which is correct since two of the cells (colored in beige) have been used up.

(34=69)B13- (69=1)B79- (1=68)AC8- (68=34)GJ8- (34=68)H79- (68=2)H13- (2=56)GJ2- (56=34)AC2-

## Exemplars

I won't duplicate the excellent list provided by Phil on his help page here.

 Go back to Unique Rectangles Continue to Extended Unique Rectangles

Email Address - required for confirmation (it will not be displayed here)

 Please enter theletters you see: Remember me
Email addresses are never displayed, but they are required to confirm your comments. When you enter your name and email address, you'll be sent a link to confirm your comment. Line breaks and paragraphs are automatically converted - no need to use <p> or <br> tags.

## ... by: Anonymous

While Robert's explanation may work for the common 2-2-2-2- 2-2-2-2- type, it doesn't translate very well into the other types. I provide a better (in my opinion) proof:

All 16 digits are restricted commons, meaning each digit can only upto 1 time in the loop. Now the 16 cells should have 16 digits, so each of the 16 restricted commons should appear exactly once, which explains the eliminations.

And yeah, as I said, the givens/solved cells don't seem to be important.

## ... by: Anonymous

I don't get why the givens/solved cells are important. The logic seems perfectly correct even when the hinges have more than one candidate

## ... by: Robert

OK, updating from my previous comment.

I think I have figured out the logic of the SK loop,and how the eliminations take place. But the description has an issue - it is not a matter of all the blue being true or all the greens being true - in fact, in the easter monster puzzle, this is not the case.

Starting at B13, if {3,8} is "true" so that the two cells contain these two values, this propagates all the way around the chain, making all of the blue candidates true. And if {2,7} is "true", this also propagates all the way around (the other direction), and makes all of the green candidates true.

But these are not the only two possibilities. B13 could contain one of {3,8} and also one of {2,7}, and in fact this is what happens in the unique solution. But we still get the eliminations in this case. Suppose there is no "3" in B13 or B79. Then if B13 also contains no "8", it must contain {2,7}, and all the green candidates are "true", including the {3,8} in B79 - this contradicts the assumption that B79 contains no "3". So B13 must contain an "8", meaning B79 cannot. But then B79 does not contain a "3" and does not contain an "8", so it must contain the blue candidates, so that all the blue candidates are true, including {3,8} in B13. So this is also contradictory. So if B13 and B79 do not contain a "3", B13 containing no "8" results in a contradiction, and B13 containing an "8" also results in a contradiction - therefore, B13 or B79 must contain a 3. By the analogous reasoning, B13 and B79 must contain an "8". However, it does not have to be the same group - in the unique solution, it is B13 that contains the "3", and B79 that contains the "8".

So I understand how the loop works now, but the description, which says that all the blue are true or all the green are true, is not correct. It's more subtle than that.
Andrew Stuart writes:

Yes you are quite right. I got the either green OR either blue from PJB as well and didn't see that was not quite accurate for the Easter Monster but it works for the pattern and all comes out in the wash. I'll amend the text.

## ... by: Robert

Hello,

It doesn't seem like the comments are monitored closely, but I'll try anyway.

I am really struggling to understand how SK loops work, and the link to pjb's comments isn't helping that much - it seems to presume some knowledge of the technique already.

From the description of the Easter Monster on this page, we have:

"Since we have identified the content of these sixteen cells as a Locked Set we can eliminate along the unit of alignment. So, since B13 contains a blue {3,8} and B79 contains a green {3,8} and the solution will be one or the other, so we can remove 3 and 8 from B5 and B6."

I am interpreting this to mean that either (i) all the blue candidates are "true" and all the green candidates are "false", or (ii) all the blue candidates are "false" and all the green candidates are "true". But according to the solution count" feature in the solver, B1 should be 2 (which is green) and B3 should be 3 (which is blue).

So am I misunderstanding something, or is there something wrong with the description?
Article created on 29-November-2019. Views: 16125