#266 False Sue De Coq

[Chris]

Hi I want to finish the grid with technique Sue De Coq but I can't find it and I waste 10 hours I give up the program find it but I don't call Sue De Coq I call other Techniques !)
the true Sue De Coq is basic variation not extended types

here a explanations from this technique Sue de Coq is a variant of Subset Counting and was first introduced by a user with nickname "Sue de Coq" under the somewhat cumbersome name of "Two-Sector Disjoint Subsets". Other users soon started to call the technique by the inventor's nickname "Sue de Coq" (SDC), and that name has been used ever since. The technique in its basic form is rather simple, but it has been enhanced several times. These enhanced versions can be found under Extended Types in this guide.

Basic Variants
The basic variant is rather simple: Look for cells at the intersection of a row and a block. You have to find either two cells containing 4 candidates or three cells containing 5 candidates. Now find a bivalue cell in the row outside of the intersection whose candidates are draw entirely from the intersection candidates. Find another bivalue cell in the block with candidates drawn from the intersection too, but different from the candidates in the row cell.

This constellation is a Sue de Coq: You can eliminate all row cell candidates from the rest of the cells in the row, all block cell candidates from the rest of the cells in the block and any intersection candidate that is left from both the row and the block. This can amount in some rather impressive steps.

The term "row" in the definition above can be replaced throughout with "column".

can you please fix Hodoku technique Sue De Coq basic variation only on the advanced technique for the update hodoku?