![]() At the start of the chains, the candidate cannot be the solution for that beginning Cell since the same basic assumption cannot lead to contradicting results. This explains the elimination of digit 2 from r4c5. Nishio Forcing Digit (same candidate in both ON and OFF): the two chains meet in a Cell with the same candidate in both ON and OFF states. Hence any cell that is seen by some green cell and some brown cell cannot contain the digit 2. This implies that the blue cells and the purple cells cannot both contain the digit 2, which means that either the green cells or the brown cells contain the digit 2. The second example below looks at the candidates for digit 2.Ī blue cell (r1c1) of cluster #1 sees a purple cell (r1c4) of cluster #2. Hence, the digit 8 can be placed in all the green cells. Since either the brown cells or the purple cells must contain the digit 8, it follows that the digit 8 can be eliminated from all the blue cells. Observe that a blue cell (r3c2) of cluster #1 sees a brown cell (r5c2) of cluster #2, and another blue cell (r2c4) sees a purple cell (r5c4) from cluster #2. The first example below looks at the candidates for digit 8. Multi-Colors have the same power as X-Chains. Another name for a move of this type is Color Wing. Any candidate which can see both of them can now be eliminated. We will explore these in further articles. Other methods use and extend these concepts, where the rules for creating chains and the rules for eliminations differ slightly. As a result, either B or D must be true, but they could also both be true. It introduces the very useful concepts of chains, links, colourings and the corresponding in-chain (rule 2) and off-chain (rule 4) eliminations. There are 2 conjugate pairs: A-B and C-D. Another way to say it is that a bridge connects these clusters. In chaining terms, we say that there is a weak link between these candidates. In coloring terms, we say that these colors are mutually exclusive. When 2 candidates in 2 clusters are peers, they cannot both be true at the same time. It is not sensible to start all over again for MC. If a move is discovered that requires only a single cluster, then we call it Simple Colors, otherwise we call it Multi-Colors. Most players just start coloring to see what it may yield. However, it is not fundamentally different from Simple Colors. The X-Chain technique and the Multi-Colors technique are equally powerful. The colors represent the parity of the candidates in the cluster. Introduce sudoku solving technique : X-Chain. Each cluster must only contain conjugate pairs and has therefore only 2 colors. Each picture may appear only once in each row, column, and 3x3 box. Linear chains have a start and end and do not branch out. Fill all of empty squares in the grid with a picture. When a candidate belongs to multiple conjugate pairs, all the candidates it is linked to will have the same color, which is the opposite color to that of the candidate itself. Chaining strategies can be divided into two types: whether they use a linear chain or a spreading network-like pattern. The player first chooses a digit, locates all the conjugate pairs in the grid and starts coloring them. Multi-Colors Multi-Colors is a subtype of coloring that uses more than 2 colors, as opposed to Simple Colors.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |