Main Page - Back

(a.k.a. Aligned ALS Exclusion) This strategy is based on extending Aligned Pair Exclusion but uses Almost Locked Sets to make some clever reductions. From the components used it could be named Aligned ALS Exclusion but Mike Barker, who formulated it first in this thread, hit on "Death Blossom" because it starts with a cell designated as the "stem" which points to Almost Locked Sets, or the "petals", and is a great deal more flowery. An Almost Locked Set is any group of N cells (that can all see each other) with N+1 candidates between them . This includes bi-value cells. A Locked Set, by contrast, contains exactly the right number of candidates for the group, examples of which are Naked Pairs and Triples.

To get a feel for what’s going it worth working backwards from the elimination of 7 in C3 in this first example. We have two Almost Locked Sets {A2,B2,G2} and {C4,C7,C9} and they both have 7 as a common number between them. If C3 did have 7 as a solution it would reduce the first Almost Locked Set to a Naked Pair with 5/6 forcing G2 to be 3. The second ALS would also reduce to a Naked Pair of 2/9 forcing C9 to be 5. If C9 is 5 and G2 is 3 then the stem cell (coloured green) G9 is left with nothing. This confirms that C3 is not 7. Reversing direction will help illuminate the Death Blossom idea since we start with green “stem” cell. G9 with {3/5} must be able to see at least two ALSs which contain all its candidates. It is important that the 3 in G9 can see all of the 3’s in the yellow coloured ALS and the 5 in G9 can see all of the 5’s in the brown coloured ALS (one instance each in this case). But G9 overall does not have to see every single cell in all the ALSs, just the cells it shares candidates with.

Death Blossom 1: Load Example or : From the Start

Now, the two ALSs must have a candidate Z in common which the "stem" cell does not have. Because ALSs contain exactly one extra candidate for the number of cells they occupy (the N+1 candidates for N cells rule), we can assert that ANY cell that can see all the Zs in both ALS but is not part of those ALSs or the stem cell can be removed. Such a cell is C3. Death Blossom was discovered by extending Aligned Pair Exclusion (APE) and asking if there was generalization beyond the pairs and triples discussed in Aligned Pair Exclusion. With Almost Locked Sets there is. The stem cell G9 and the elimination cell C3 can’t see each other – they not aligned, but the pairs they can make do affect the board. In our example, consider the pairs that can be made between the 7 in C3 and the 3/5 in G9. These are 3/7 and 5/7 in C3 and G9 respectively. Both these turn out to be illegal since they would reduce our ALSs to having less candidates than cells. So whatever the solutions to the two disparate cells C3 and G9, C3 will never contain a 7.

In Figure 2 quite a different arrangement is apparent but the logic is identical. The two yellow coloured cells form a two-cell ALS with the values {3/5/7}. At the bottom there is a four-cell ALS with {2/3/6/8/9}. Our stem cell again contains only two candidates {6/7} (coloured green) but don't think this is a restriction. There could be five or six numbers in the stem cell. As long as there are sufficient Almost Locked Sets that the candidates can see then the pattern can be made to work. There is another way to look at this example which mirrors some strategies already covered. Starting in G3 If G3 is 7 -> D3=5 -> D7=3 therefore D9,E9,F9,J7 <> 3 If G3 is 6 -> G8=9 -> G7=2 -> G9=8 -> J9=3 therefore D9,E9,F9,J7 <> 3 Much of the first-sight complexity seems to evaporate when traced through in this manner.

Death Blossom 2: Load Example