Sue de Coq
First, recall the ALS (almost locked set): n cells in the same house (row, column, or box) contain a total of n+1 distinct candidates. An ALS has an important property: if one candidate is removed from all its cells, the remaining n candidates are confined to n cells, forming a locked set.
We can also look at this in terms of cells. If another unfilled cell in the same house has candidates drawn entirely from those n+1 digits, it can join the ALS to form a locked set of n+1 cells with n+1 candidates, allowing eliminations.
Sue de Coq uses this property.
Basic Structure
A Sue de Coq structure uses a box and an intersecting row or column. In the Basic form:
- An ALS, called the box ALS, lies in the box outside the intersection.
- An ALS, called the non-box ALS, lies in the row or column outside the intersection.
- The intersection has exactly two unfilled cells.
- All candidates in the intersection fall into two disjoint sets:
- At least two candidates from the box ALS.
- At least two candidates from the non-box ALS.
The two ALSs may contain the same candidates, provided those candidates are absent from the intersection. This keeps the two candidate groups within the intersection disjoint.
When these conditions are met, we have a Sue de Coq structure. From this structure, we can deduce the following: one intersection cell must take a digit from the box ALS, and the other from the non-box ALS. Otherwise, if both took digits from the box ALS, for example, those two cells and the ALS would have n+2 cells but only n+1 distinct candidates. They could not all be filled without repeating a digit, violating Sudoku rules.
Thus,
- One intersection cell joins the box ALS to form a locked set of
n+1cells with the ALS's originaln+1candidates. We can eliminate those candidates from every cell in the box outside both the intersection and the ALS. - The other intersection cell similarly joins the non-box ALS to form a locked set, allowing eliminations in the row or column.
Extra Form
When the intersection has three unfilled cells and all three are used as the intersection between the box ALS and the non-box ALS, an extra candidate absent from both ALSs must be present. This gives the Extra form of Sue de Coq, with the following conditions:
- Their candidates fall into three disjoint sets:
- (Same as the basic form) At least two candidates from the box ALS.
- (Same as the basic form) At least two candidates from the non-box ALS.
- Exactly one extra candidate that differs from all candidates drawn from either ALS.
Once these conditions are met, we can deduce the following: one intersection cell must take the extra digit; of the remaining two, one must take a digit from the box ALS and the other from the non-box ALS.
To see why, suppose the extra digit were absent from the intersection. At least two of the three cells would then have to take digits from the same ALS. Together with that ALS, they would give n+2 cells with only n+1 distinct digits. Those cells could not all be filled without repeating a digit, violating Sudoku rules.
The extra digit must therefore occupy exactly one intersection cell. The remaining two cells then reduce to the basic structure.
This gives us two kinds of eliminations:
- The extra digit is confined to the intersection and can be eliminated from all other cells in both the box and the row or column.
- Each ALS joins one intersection cell to form a locked set, with the same elimination scope as in the basic structure.
Free Cell Form
When the intersection has three unfilled cells, we can also use just two as the actual intersection between the box ALS and the non-box ALS, treating the remaining cell as a free cell. This gives the Free Cell form of Sue de Coq.
To identify this form, try treating each unfilled cell in turn as the free cell, with the other two forming the actual intersection. The conditions are similar to those for the basic structure:
- A box ALS lies in the box outside the actual intersection; it may include the free cell.
- A non-box ALS lies in the row or column outside the actual intersection; it may include the free cell.
- The actual intersection has exactly two unfilled cells.
- All candidates in the actual intersection fall into two disjoint sets:
- At least two candidates from the box ALS.
- At least two candidates from the non-box ALS.
Once these conditions are met, reasoning similar to that used for the basic form gives the following eliminations:
- Within the box, eliminate the box ALS's candidates from cells outside both the actual intersection and the box ALS. These target cells may include the free cell.
- Within the row or column, eliminate the non-box ALS's candidates from cells outside both the actual intersection and the non-box ALS. These target cells may include the free cell.
Cannibalism
In the Free Cell form of Sue de Coq, the free cell lies outside the actual intersection and can therefore be an elimination target.
Sue de Coq requires the candidates drawn from the two ALSs to be disjoint only within the actual intersection. The same candidate may occur in both ALSs.
And the free cell may also belong to either ALS. Together, these two facts allow the following situation: both ALSs contain candidate x, which is absent from the actual intersection, as required. The free cell belongs to one ALS and contains x, yet x can still be eliminated from it. This is because the locked set formed on the opposite side must contain x.
Removing x from the free cell does not mean that its ALS loses x entirely: other cells in that ALS may still contain x. Because the free cell belongs to one of the ALSs and is part of the structure itself, this elimination is called cannibalism.
Cannibalism is a phenomenon within the Free Cell form of Sue de Coq, rather than a separate technique. It is simply the usual elimination rule applied to the free cell: once a locked set is formed on one side, any matching candidates in the free cell can be eliminated, provided the free cell does not belong to that side's ALS. This holds whether the free cell belongs to the opposite ALS or to neither ALS.
AALS Form
An ALS (almost locked set) consists of n cells with n+1 distinct candidates, or m-1 cells with m distinct candidates, all in the same house. It has one fewer cell than distinct candidates. The property used by Sue de Coq is this: if we can find one other cell in the same house whose candidates are all drawn from the ALS, that cell can join the ALS to form a locked set, allowing eliminations. (We do not need to know exactly which cell it is, as long as we can deduce that such a cell must exist.)
We can extend this idea to an AALS (almost-almost locked set): m-2 cells with m distinct candidates, all in the same house. It has two fewer cells than distinct candidates. Its property is similar: if we can find two other cells in the same house whose candidates are all drawn from the AALS, they can join it to form a locked set, allowing eliminations too.
The preceding forms of Sue de Coq all rely on an ALS in both the box and the non-box house. The intersection must contribute one cell to each ALS to form a locked set, for a total of two cells. Thus, these forms either have exactly two unfilled intersection cells (Basic), or have three with one serving another purpose (Extra: the additional cell takes the intersection's own extra candidate; Free Cell: the additional cell either belongs to one of the ALSs or is left out of the analysis and treated as an ordinary cell).
An AALS gives us another option. When the intersection has three unfilled cells, an AALS on one side and an ALS on the other can form an AALS Sue de Coq structure: two of the three intersection cells contribute to the AALS side, and one to the ALS side.
- An ALS or AALS lies in the box outside the intersection, called the box ALS/AALS.
- An ALS or AALS lies in the non-box house outside the intersection, called the non-box ALS/AALS.
- Exactly one of the two selected sets is an AALS; call its side the AALS side and the other the ALS side.
- The intersection of the two houses has exactly three unfilled cells.
- All candidates in the intersection fall into two disjoint sets:
- At least two candidates from the AALS side.
- At least two candidates from the ALS side.
- At least two intersection cells contain candidates from the AALS side.
Most of these conditions are similar to those of the basic structure, with a few additional requirements for the AALS.
Once these conditions are met, the conclusions and elimination rules are also similar:
- Two of the three unfilled intersection cells must take digits from the AALS side. Together with the AALS's original
m-2cells, they form a locked set ofmcells withmcandidates. In its house, eliminate candidates matching those in the AALS from cells outside both the AALS and the intersection. - The other unfilled intersection cell must take a digit from the ALS side, forming a locked set with the ALS. In its house, eliminate candidates matching those in the ALS from cells outside both the ALS and the intersection.