- 1 The Fishy Cycle (X-Cycle)
- 2 When Should You Use X-Cycles?
- 3 How to Use X-Cycles
- 4 Weak Links and Strong Links
- 5 Why does this work?
- 6 X-Cycles
- 7 X-Cycles 2
- 8 3 X-Cycles
- 9 4 X-Cycles
- 10 Weak X-Cycles
- 11 Strong X-cycles
- 12 Rule 3 of the X-Cycle (Odd number of links)
The Fishy Cycle (X-Cycle)
A Fishy Cycle (X-Cycle) is a continuous loop of single-digit candidates. It alternates between strong and weak linkages.
Before these patterns were recognized as constraint sets, the Fishy Cycle was proposed to generalize fish patterns such as X-Wing, Swordfish, and Jellyfish.
At the time, players felt that each defining line should have no more than two choices. This archaic definition of Swordfish and Jellyfish may still be found on certain websites.
X-Cycles are the beginning of a broad family of ‘chaining methods’ essential to solving the more difficult Sudoku problems.
Simple coloring is closely connected to X-Cycles.
Simple coloring is a method that is quite similar to X-Cycles.
We start with a single candidate and seek conjugate pairings, after which we alternate the colors for each candidate.
On the other hand, the X-Cycles technique can only be employed when the chain forms a loop.
When Should You Use X-Cycles?
Whether you notice that the numbers are linked in a loop during coloring, you may apply the X-Cycle technique to determine if any candidates can be removed.
How to Use X-Cycles
There are an even number of candidates in the loop.
If the loop contains an even number of possibilities, we know that it is free of faults and inconsistencies.
Either one of the colors is correct.
As a result, we can rule out candidates who can view two or more candidates in the loop.
If the loop contains an odd number of candidates, we must use the concept of weak and strong linkages.
I’ll describe what weak connections and strong linkages are in more detail below.
Before discussing X-Cycles, it’s vital to understand strong and weak links.
Weak Links and Strong Links
When there is a conjugate pair, the relationship between the two numbers in the pair might be either weak or strong. Each one is explained in detail below.
When two of the same candidates appear in the same unit, they are referred to as conjugate pairs.
If that candidate appears more than twice in that unit, the conjugate pair’s link is considered a weak link.
If a conjugate pair has a weak link, you may claim that if one is true, the other is NOT true.
In the preceding example, I illustrate a connection between two 8s in a box because there is another 8 inside the box with the connected 8s, these 8s share a WEAK connection.
If the candidate of a conjugate pair does not exist anywhere else in the unit except in the pair itself, the pair’s connection is regarded as strong.
When a conjugate pair has a strong relationship, you may state that if one is NOT true, the other is true.
Because there are no extra 8s in the same unit, the 8s in the preceding example share a STRONG connection.
The Loop Has an Unusual Number of Candidates – Two Strong Links
If there are an odd number of candidates in the loop, we seek one with two strong linkages connecting it. If such a candidate exists, we know it must be accurate, and we can solve the square.
Why does this work?
If two candidates with opposing colors (let’s call them A and B) have a strong relationship with a candidate (let’s call him C), you may claim that if A or B is NOT true, then C MUST be true.
But you know that since they are opposing colors, only one of A or B can be true. So one of these will undoubtedly be false.
As a result, C is unquestionably true.
The Loop Has an Unusual Number of Candidates – Two Weak Links
If there are an odd number of candidates in the loop, we seek one with two weak connections connecting it. If such a candidate exists, we know it must be erroneous, and we may remove it.
The figure below depicts the simplest basic X-cycle. The solid red line represents the strong relationship, whereas the dotted red line represents the weak link.
This acts in the same manner as an X-wing and always equals: 1 1 or 1 1. As a result, one cannot be typed in the X-marked places.
So, the X-cycle of a given number refers to a cell – strong – cell – weak – cell – strong – cell
cell – strong – cell – weak – cell – strong – cell – strong – cell – strong – cell
(It also works if there are strong linkages rather than weak ones inside the pattern.)
The number of candidates in the weak linkages may be reduced; however, these cells alter depending on the scenario.
This is a rather complicated design. The solid red line represents a strong relationship, whereas the dotted red line represents a weak link.
The 1 should go in one of the two patterns below.
As a result, 1 cannot be typed in the overlapping regions X, as seen below.
Another complicated design is seen below. Again, the solid red line represents a strong relationship, whereas the dotted red line represents a weak link.
The 1 may be found in one of the two patterns below.
When the two patterns are joined, the figure below shows the result.
A 1 cannot be typed in the overlapping spaces highlighted with an X. (The Xs of the strong connection are not visible.)
Here’s a simple pattern.
As you can see, 1 cannot be in the X-marked places.
When the samples are examined, the connection in the weak link, whether a row or column, is eliminated as a candidate, and the cells in that row/column are removed as candidates. If it is a box, the remaining cells are deleted as candidates.
If you can utilize this approach, you are an expert at Sudoku.
Odd-length X-Cycles are also beneficial, but the reasoning is different.
For example, consider an odd-length X-cycle that alternates except for one choice point with two weak links in a row.
That would be 4@C6 in the cycle 4@F6-4@C6-4@C3=4@D3-4@D4=4@F6 in the example below.
Consider one of the strong connections around 4@C6, such as 4@D4=4@F6.
The strong relationship indicates that one of these options must be chosen.
If 4@F6 is selected, the weak link 4@F6-4@C6 indicates that 4@C6 is removed.
What if 4@D6 is selected? The chain demonstrates that 4@C6 is likewise deleted in that scenario. 4@C6 is removed regardless of whether 4@D4 and 4@F6 are picked; hence this “weak” X-Cycle unconditionally removes 4@C6. Weak X-cycles are more prevalent than ordinary X-cycles, making this a particularly valuable method.
What about an odd-length X-cycle that alternates except for one choice point with two strong connections in a row?
Here is a 5 6@A6=6@B4-6@B2=6@D2-6@D6=6@A6 X-Cycle.
The distinguishing decision point is forced rather than discarded in this example.
Let’s see how this pans out.
If 6@A6 is removed, it forces 6@B4, which forces 6@D2, which forces 6@A6 – a contradiction! If 6@A6 is chosen, the two neighboring options are removed; however, since the ensuing linkages are weak, further inferences are halted, and contradiction is avoided.
A6 is forced to be 6 by the X-Cycle (and, in this case, solves the puzzle).
It can save time and effort by recognizing that strong x-cycles are just a subset of weak x-cycles.
In the above example, if we considered the 6@A6=6@B4 connection as a weak rather than a strong link, we would have a weak x-cycle, eliminating B4.
However, because 6@A6=6@B4 is a strong connection, A6 would be forced right away. So we don’t need to search separately for strong x-cycles – as long as we identify the weak x-cycles, the forced-choice will be obvious quickly after.
X-Cycles are similar to Single Chains in that they employ linkages between candidates with comparable numbers inside a unit (row, column, or box).
Links are classified as Strong (dark green) if the candidates they link are the only two of that value in the unit, or as Weak (light green) if there are other candidates of the same value in the unit.
An X-Cycle is formed when a set of similar linkages join together to create a full loop.
If an X-Cycle fits the following characteristics, it is subject to Rule 3:
It has an odd number of connections.
There is just one example of a series of weak connections, while all strong linkages occur in groups with an odd number of members.
This problem features a loop for candidates with the value 2.
Examining the loop will quickly persuade you of the reality of Rule 3, which stipulates that the candidate at the intersection of two weak links must be a non-solution and may be discarded.