SueDeCoqEx, Franken SueDeCoq

Define conditions for SueDeCoq in a new way, and extend the SueDeCoq algorithm.

• SueDeCoq (original form)
• SueDeCoqEx1    SueDeCoqEx2    FrankenSueDeCoqEx3
• Finned SueDeCoqEx    
• Finned SueDeCoqEx example    print()print()

SueDeCoqEx2

SueDeCoq's mechanism is "Locked", hich is a combination of A2LS and two ALS. The requirements for success of SueDeCoqEx are as follows.

[Conditions for SueDeCoqEx]
1. There are A2LS and two ALS(ALS_1, ALS_2). There is no overlap between the two ALS.
2. A2LS and ALS_1 have RCC_1. A2LS and ALS_2 have RCC_2. |RCC_1|>=2, |RCC_2|>=2.
3. There is no overlap between RCC-a and RCC-b.
4. |A2LS digits| - 2 = |A2LS cells|

Franken SueDeCoq

"SueDeCoqEx" extends further with a natural extension. Suppose that A3LS is connected to three disjoint ALS (ALS_1, ALS_2, ALS_3) using RCC. Let's call this "Franken SueDeCoqEx".

[Franken SueDeCoq conditions]
1. There are A2LS and three ALS(ALS_1, ALS_2, ALS_3). There is no overlap between the three ALS. (The "overlapping" condition may be removed...> v5.1)
2. A2LS and ALS_1 have RCC_1. A2LS and ALS_2 have RCC_2. A2LS and ALS_3 have RCC_3. |RCC_1|>=2, |RCC_2|>=2, |RCC_3|>=2.
3. There is no overlap between RCC-a, RCC-b and RCC-c.
4. |A3LS digits| - 3 = |A3LS cells|

Franken SueDeCoq3
stem AnLS : r7c23 r8c1 r9c2 #1234589
1st ALS : r9c1 #23 RCC;#23
2nd ALS : r8c3 #48 RCC;#48
3rd ALS : r46c3 r5c2 #48 RCC;#19
exclude: r7c1#24

3248615976579438219185273642.143....5.32.6...4..7.....1..6.....8..1746..7..39..1.
641..8329873291645592..4187.8..2.4.1.....92.3...41.8.6......73..6.9..51...714.968
(using "HoDoKu" Puzzle.）

SueDeCoqEx1

"SueDeCoqEx" can also be reduced. This is called"SueDeCoqEx1".
Since ALS and ALS are linked by two RCCs, this is"ALS-XZ doubly linked".
This shows the relationship between ALS-XZ and SueDeCoq.



SueDeCoqEx1
stem AnLS : r79c9 r8c89 #23589
1st ALS : r5c9 #89 RCC;#89
exclude: r4c9#89 r6c9#89

SueDeCoqEx1
stem AnLS : r57c2 #125
1st ALS : r8c1 r9c12 #2345 RCC;#25
exclude: r5c1#4 r6c2#5 r7c1#24 r7c3#4 r8c3#4 r8c9#4

3248615976579438219185273642.143....5.32.6...4..7.....1..6.....8..1746..7..39..1.
641..8329873291645592..4187.8..2.4.1.....92.3...41.8.6......73..6.9..51...714.968
(using "HoDoKu" Puzzle.）

Finned SueDeCoqEx

Just as Fish has Fish with Fin, SueDeCoq also has SueDeCoq with Fin.
Fish with Fin is a pattern with Fin added to BaseSet. When CoverSet is in a position that covers BaseSet and Fin at the same time It becomes Locked.

SueDeCoq connects AnLS and ALS with two RCCs each,
   |Number of digits in AnLS| - n = |Number of cells in AnLS|
This is a pattern that holds true.
(There are other conditions such as no overlapping of digit elements.)
Finned SueDeCoq is a case where the digit arrangement pattern of ALS is inconsistent with AnLS.
Below is an example of Finned SueDeCoq(n=1,2,3).


Fin is an element that could not become RCC.
If all elements external to AnLS and ALS cause Fin to be negatively determined, Finned SueDeCoqEx will fail.
Therefore, elements(outside ALS) that negatively determine all Fins are negatively determined.



Finned SueDeCoq(n=1) matches ALS-XZ's singlylinked.

Finned SueDeCoq example

Finned SueDeCoqEx2
stem AnLS : r789c9 #23589
1st ALS : r8c8 #35 RCC;#35
2nd ALS : r4c7 r5c9 #789 RCC#8
exclude: r4c9#9 r6c9#9

Finned Franken_SDCEx3
stem AnLS : r467c2 #346789
1st ALS : r8c2 #39 RCC;#39
2nd ALS : r9c2 #46 RCC;#46
3rd ALS : r4c7 r5c9 #789 RCC:#7
exclude: r5c2#8

3248615976579438219185273642.143....5.32.6...4..7.....1..6.....8..1746..7..39..1.
641..8329873291645592..4187.8..2.4.1.....92.3...41.8.6......73..6.9..51...714.968
(using "HoDoKu" Puzzle.）