X-Cycles (Part 2)

Strategies for Number Puzzles of all kinds

Main Page

Solvers

Puzzles

The Daily Killer

The Daily KenKen ^New!

Sample Puzzle Pack

Basic Strategies

Tough Strategies

Diabolical Strategies

Extreme Strategies

Depreciated Strategies

Str8ts

Other

The Logic of Sudoku

Order Str8ts Book 1

Order Now!

Order Str8ts Book 2

Order Now!

X-Cycles (Part 2)

So far, I been looking at X-Cycles which alternate perfectly all the way round. There are two interesting rules that lead to eliminations when we identify an imperfection in a loop which is called a discontinuity.

A discontinuity occurs when we find two strong links next to each other (that is, with no weak link between them) or two weak links next to each other (with no strong link dividing them). These rules work only if there is exactly one discontinuity, and such a loop will always have an odd number of nodes.

“Discontinuity” doesn’t mean that the loop is broken or that it’s a chain; it refers only to the imperfection that would otherwise make links alternate strong/weak/strong, and so on.

Nice Loops Rule 2

Here is a rule that applies in the presence of two adjacent strong links:

If the adjacent links are links with strong inference (solid line), a candidate can be fixed in the cell at the discontinuity.

This rule allows us to know the solution of a certain cell absolutely, no matter how many other candidates there may be on that cell. Unlike the case of the first Nice Loop rule, we are not looking at a mass of eliminations outside the loop; instead, this rule tells us something about the loop itself. Let’s look at an example before examining the logical proof.

For discontinuous X-Cycles, the notation always starts with the discontinuity. In Figure 1, our Nice Loop on number 1 is:

Figure 1: Nice Loop on 1

Figure 1: Nice Loop on 1: Load Example or : From the Start

X-CYCLE on 1 (Discontinuous Alternating Nice Loop, length 6):
-1[J1]+1[G3]-1[E3]+1[E8]-1[J8]+1[J1]
- Contradiction: When 1 is removed from J1 the chain implies it must be 1 - other candidates 3/9 can be removed

We have two strong links joined at J1; therefore, J1 is 1. One way to make sense of this logically is to trace round the alternative. If J1 was not a 1 G3 and J8 would have to be 1s. That would remove the candidate 1 from E3 and oblige E8 to be a 1. But hang on - that forces two 1s in column 8. A contradiction so the 1 must exist in J1.

Nice Loops Rule 3

Our third rule dictates what happens when two weak links form a discontinuity in a loop:
If the adjacent links are links with weak inference (broken line), a candidate can be eliminated from the cell at the discontinuity.

The brown cell is the discontinuity based on two weak links that are next to each other in the loop. We can safely eliminate the 1 from this node. It might not seem much of an elimination considering how powerful the previous two rules are, but this type of Nice Loop configuration – two weak loops – is actually the most common.

The solver would return this message:

X-CYCLE on 1 (Discontinuous Alternating Nice Loop, length 6):
+1[C3]-1[C7]+1[G7]-1[G2]+1[H3]-1[C3]
- Contradiction: When C3 is set to 1 the chain implies it cannot be 1 - it can be removed

Figure 2: Nice Loop on 3

Figure 2: Nice Loop on 3: Load Example or : From the Start

Just a little further on from we have some more AICs including this 8 elimination

X-CYCLE on 8 (Discontinuous Alternating Nice Loop, length 6):
+8[B7]-8[B1]+8[C3]-8[E3]+8[E7]-8[B7]
- Contradiction: When B7 is set to 8 the chain implies it cannot be 8 - it can be removed

Figure 3: Nice Loop on 8

Figure 3: Nice Loop on 8: Load Example or : From the Start

Weak and Strong Links

X-Cycles introduced the idea of Weak and Strong links but I want to make a more precise definition of terms since there are subtlties which will be useful in other chaining strategies. The rough and ready distiction between Strong and Weak links is to do with how many candidates are in a unit – namely, Strong links are formed when only two are present, while three or more imply a Weak link.

From a strong link we can infer that
if not A, then B

From a weak link, we can infer only that
if A then not B, C, D according to how many candidates there are in a unit

This implies that:

Strong links are "links with strong inference"; and
Weak links are "links with weak inference".

However, the following is also true that for a strong link:
if A, then not B

So, some Strong links can be reversed to give us a "link with weak inference" - if the occasion calls for it. It is perfectly logical to assert on a unit with two candidates of X both:

If Not A then B (!A =>B)
If A then Not B (A => !B)

In Figure 5 we have an array of 6 candidates on a board. A number of strategies can show that the 6 on H9 can be eliminated. I have coloured some cells using Simple Colouring Rule 2 which link up some pairs on the board - either all of the yellow cells will be 6 or all of the cyan cells will be 6. Since H9 can see C8 (yellow) and H5 (cyan) it cannot be a 6 since it can seel cells with both colours.

Now, we can also create a Nice Loop as I have done with blue lines. Our aim is to show that the circled 6 on H9 is eliminated because there are two weak links forming a discontinuity. That is all correct and invokes Nice Rule 3. But there seem to be three strong links joined up. What happened to the alternating nature of the X-Cycle?

If a strong link can have weak inference, then let’s just change the link from C4 to A5 to imply such. Simple. We get our pattern. If 6 is on C4, then it is not on A5 (weak inference), or if it is on A5, then it is not on C4 (also weak inference – and all very logical).

I have coloured the Strong link with weak inference red in Figure 5.

Figure 5: Colouring Example and Nice Loop

Figure 5: Colouring Example and Nice Loop

This theme is continued in Grouped X-Cycles.

Comments

Monday 12-Dec-2011

... by: Eric

@Roger: Figure 2 now contains a nice loop on 1 (although the figure title states differently)

@Gary: You are right. If a link is strong it implies that the link also meets the conditions of a weak link. Please note that a weak link becomes strong if and only if 2 candidate locations are left in any row, column or box

@patriotkiller18: The best way to understand, is to forget that the 2 sixes in box 2 are connected by a strong link. Then notice that the 2 sixes in box 2 are connected by a weak link: If A5 contains a 6 than C4 cannot contain a 6, and if C4 contains a 6, then A5 cannot contain a link.

Another way to overcome your problem is simply a redefinition of the X-Cycle requirements: An X-Cycle is a series of links hopping from one candidate to another, where at least an alternate series of strong links exist. I am afraid this might be a bit too theoretical, so I suggest you just forget about the stong link in box 2.

Tuesday 28-Jul-2009

... by: roger freeman

Hello to you.
In 'x-cycles pt2'/nice loop rule3/fig2, concerning elimination of candidate 3 in cellB6, where two weak links converge; can this loop be routed thro cellC6 and therefore allow that candidate 3 also be eliminated in cellC6.
Sorry if I'm being v silly. If another loop thro' cellC6 and elimination of
candidate3 at that cell is not legitimate, could you explain please.
I feel fearful of serious confusion!
Many thanks indeed for your site.
Bests,Roger Freeman
Corbridge,Northumberland

Monday 27-Apr-2009

... by: Gary Maness

I would like to point out that ALL strong links, by definition have a weak inference.

!A=>B ~ A=!B

But not all weak inferences are strong ones,

A=>!B !~ !A=B.

Am I right? I think I remember proving this in my foundations of Mathematics course.

Saturday 11-Apr-2009

... by: patriotkiller18

I cannot understand how the 2 sixes is box 2 can be a weak link in any way. I understand what your saying if not a then b, but that's every strong link. I know I am the problem but do you have any further examples or info about where i can go to get more details. thank you very much for this site, it must take alot of your time and it is appreciated.

Post a Comment using Facebook...
or post a Comment or Question here...

Article created on 4-May-2008. Views: 17986
This page was last modified on 17-December-2011, at 13:13.
All text is copyright and for personal use only but may be reproduced with the permission of the author.
Copyright Andrew Stuart @ Syndicated Puzzles Inc, 2011