Two base cells and two target cells with a special constraint: base candidates must appear in the targets.
Junior Exocet (JE): Two "base" cells (usually in the same row and box) and two "target" cells (specific positions in different boxes) have a special relationship.
Every digit in the base candidates must appear in at least one target cell. This constraint allows eliminating non-base candidates from the target cells.
Extremely rare and one of the most complex techniques.
137 | 137 | 2 | 4 | 8 | 5 | 4 | 6 | 9 |
| 2 | 5 | 4 | 1357 | 9 | 7 | 6 | 8 | 5 |
| 9 | 6 | 8 | 3 | 4 | 5 | 1347 | 2 | 6 |
| 3 | 9 | 5 | 4 | 6 | 1 | 2 | 49 | 8 |
| 4 | 7 | 39 | 1 | 2 | 38 | 6 | 3 | 9 |
| 6 | 3 | 4 | 9 | 58 | 6 | 9 | 5 | 7 |
| 2 | 4 | 58 | 7 | 5 | 9 | 48 | 6 | 3 |
| 5 | 8 | 6 | 49 | 7 | 6 | 5 | 38 | 4 |
47 | 9 | 5 | 8 | 6 | 3 | 7 | 4 | 1 |
Base: R1C1,R1C2={1,3,7}. Targets: R2C4, R3C7. → Eliminate all candidates from target cells that are not in {1,3,7}.
This 9×9 puzzle is solver-verified to require this technique on its solution path.