![]() X and D are both blue and they are in the same unit (the row in this case). Now we have arrived at the contradiction. Both these point to D which must be coloured blue, as well as F along the bottom row. From cell B I can find two more pairs at C and E which I colour in green. Remember, we are only looking at candidate 5 and units with two 5s in them (called conjugate pairs).Ī has two conjugate pairs, B and X - which are painted in an alternative colour, blue. You assign the start of a promising chain with an arbitary colour, in this case Green (A at D3). It will be a rare occasion if you need more than 5.Īnother way of looking at this is the popular technique of Colouring. Here twelve cells (A to L) are joined by eleven links to target the cell at G2. In some cases, ridiculously long as in this example. Have a look at the next strategy for an explanation for cells 'seeing' each other.Īs long as the chains are linked by an ODD number of links and there is only two candidates in each unit of each link, this strategy will work. Since there is a 5 at G3 (marked with X) we can removed it. Any cell that both A and D can see cannot contain a five - in this case D8 and G3. Whatever way round you think it through EITHER A OR D must be a 5. B cannot be which forces C to be 5 which eliminates 5 from D.Now think in reverse.If D is 5 then C cannot be, B must be and A cannot be. ![]() Singles Chain Example 1: Load Example or From the start If we do then something very useful occurs. We are hoping to make an odd number of links (the green lines in the diagram). Goto Basic Strategies Naked Pairs Naked Triples Naked Quads Hidden Pairs Hidden Triples Hidden Quads Intersection Removal Goto Fishy Strategies X-Wing Sword-Fish Jelly-Fish Multivalue-X-Wing Finned X-Wing Sashimi Finned X-Wing Advanced Strategies on this page Singles Chains a.k.a Simple Colouring Multi-Colouring Y-Wing a.k.a XY-Wing Y-Wing Chain XY-Chains XYZ-Wing WXYZ-Wing Aligned Pair Exclusion Remote Pairs Unique Rectangles Guardian/Broken Wings Death Blossom ![]() In the example to the right there are only two 5's at A and B IN THAT ROW. Obviously the corners of this chain must change from one type of unit to another - for example a pair in a row followed by a pair in a column and then a row again or a box. If we can join a sequence of these pairs we'll form a chain. Having three or more won't do and we must ignore units with more than two of N. We are looking for pairs of N in any row, column or box. ![]() Let N be our candiate we're scanning the board for. We can scan the board for a configuration looking at one number at a time. Fortunately there is a very simple chain of clues thats works with single candidate numbers only. Single's Chains (a.k.a Colouring, Open Chain of Sudo)Ĭhains form a big part of the advanced strategy armory. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |