Skip to content

Sue de Coq (Basic) ​

Loading demo...

Sue de Coq uses the intersection of a box and a row or column (the non-box house) to contribute one cell to an ALS in each house, forming two locked sets and enabling eliminations. This page covers the Basic form, where the intersection has exactly two unfilled cells.

How to spot it ​

  • Check each intersection with exactly two unfilled cells, together with its box and non-box house (row or column).
  • Find one ALS in each house, outside the intersection. Call them the box ALS and the non-box ALS.
  • The intersection must contain at least four distinct candidates, satisfying these conditions:
    • All candidates come from the box ALS and the non-box ALS, with no extra candidate.
    • At least two come from the box ALS.
    • At least two come from the non-box ALS.
    • The two candidate groups within the intersection are disjoint. (The ALSs themselves may contain the same candidates, but those candidates must be absent from the intersection.)
  • Eliminations:
    • Eliminate the box ALS's candidates from box cells outside both the box ALS and the intersection.
    • Eliminate the non-box ALS's candidates from cells in the non-box house outside both that ALS and the intersection.
Sue de Coq (Basic)

How it works ​

Once the above conditions are met, we can deduce the following: one intersection cell must take a digit from the box ALS, and the other from the non-box ALS.

Any other arrangement in the intersection would leave some cell in one of the ALSs with no digit left to place, violating Sudoku rules:

  • If both unfilled intersection cells took digits from the box ALS, they and the box ALS (n-1 cells with n candidates) would form a structure of n+1 cells with only n candidates, leaving one cell unfillable.
  • If both unfilled intersection cells took digits from the non-box ALS, they and the non-box ALS would form a structure of n+1 cells with only n candidates, leaving one cell unfillable.

Therefore, only one arrangement is consistent with Sudoku rules:

  • One intersection cell takes a digit from the box ALS, and the other takes a digit from the non-box ALS.

This gives the following conclusions:

  • The box ALS and its corresponding intersection cell form a locked set. Its candidates can be eliminated from box cells outside both the box ALS and the intersection.
  • The non-box ALS and the other intersection cell likewise form a locked set. Its candidates can be eliminated from cells in the non-box house outside both that ALS and the intersection.

Examples ​

8935835592424289682695859595792792591458945895715797895915858935135989454573574934925825783573538684648412677539618473163841263724616829416312957

In the board above, the intersection of box 6 and row 5 has two unfilled cells, {R5C7, R5C9}, with candidates {5, 7, 8, 9}. Of these, {8, 9} come from the bivalue ALS R6C7 in box 6, and {5, 7} come from the bivalue ALS R5C4 in row 5. These two groups are disjoint, and there are no other candidates in the intersection, forming a Basic Sue de Coq structure.

One intersection cell must take a digit from {8, 9}, and the other from {5, 7}. Otherwise, if both took digits from {8, 9}, R6C7 in box 6 would have no digit left to fill it. If both took digits from {5, 7}, R5C4 in row 5 would have no digit left to fill it.

The intersection cell that takes 8 or 9 therefore forms a naked pair with R6C7 in box 6. Candidates {8, 9} can be eliminated from box 6 outside both R6C7 and the intersection. Likewise, the intersection cell that takes 5 or 7 forms a naked pair with R5C4 in row 5. Candidates {5, 7} can be eliminated from row 5 outside both R5C4 and the intersection.


1379391379149471717919176868155757169467969149159576896789678956168916893689346891494668956896895679578946895689468956561363561368526642583934232841322573274113242789

In the board above, the intersection of box 6 and row 4 has two unfilled cells, R4C7 and R4C8, with candidates {1, 4, 5, 9}. Of these, {4, 5} come from the ALS {R5C9, R6C9} in box 6, and {1, 9} come from the ALS {R4C3, R4C5} in row 4. These two groups are disjoint, and there are no other candidates in the intersection, forming a Basic Sue de Coq structure.

Both the box ALS and the row ALS contain candidate 6, but it is absent from the intersection. It therefore does not affect the division of the intersection candidates into two disjoint sets.

One intersection cell must take 4 or 5. Together with {R5C9, R6C9}, it forms a naked triple in box 6. Candidates {4, 5, 6} can be eliminated from box 6 outside both the box ALS and the intersection. The other intersection cell must take 1 or 9. Together with {R4C3, R4C5}, it forms a naked triple in row 4. Candidates {1, 6, 9} can be eliminated from row 4 outside both the row ALS and the intersection.


1234623467834678379479136812481234683483483481234634673474712412346346934634634791379149348923493924937834783481391381489134826782792796782678926671212672342347834782797827959126575898251567265514398534615

The board above contains a Basic Sue de Coq structure in box 7 and column 2. The six distinct candidates in the intersection fall into two disjoint groups, one from each ALS, with more than two distinct candidates in each group.