Jeff wrote:This is evident by the fact that I have never seen a proof for a swordfish or jellyfish being presented.
OK, I'll rise to the challenge
.
Swordfish proof:For every Sudoku, candidate C must be found exactly once in any row (or column). If a row has only 3 possible cells for C, then it must be assigned to one of these 3 cells.
Given a puzzle that has 3 rows where candidate C is restricted to exactly the same three columns (and no more than 3 columns), and since
1) candidate C must be assigned once in each of these three rows
2) no column can contain more than one of candidate C
then candidate C must be assigned exactly once in each of these columns within these three rows. Therefore, it's not possible for any other cells in these three columns to contain candidate C.
This same logic applies when a puzzle that has 3 columns where candidate C is restricted to exactly the same three rows.