Y-Wing
If a "Bi-Value" Cell can see two other "Bi-Value" Cells that contain one candidate of the first Cell and the same other candidate, then that other candidate can not be the solution in any Cell that "sees" the two "Bi-Value" Cells where it is present.
Indeed, whatever the solution in the first Cell, the "other" candidate must be the solution in one of the two "other" Cells.
In the example above the Y-Wing is formed by J2 that "sees" H1 and J9.
If candidate 5 is the solution in J2, then candidate 3 must be the solution in H1 which eliminates all candidates 3 in Row "H" (in particular in H7) and in Square "7" (in particular in J1).
If candidate 9 is the solution in J2, then candidate 3 must be the solution in J9 which eliminates all candidates 3 in Square "9" (in particular in H7) and in Row "J" (in particular in J1).
So, whatever the solution in J2, then candidates 3 in J1 and H7 are always eliminated.
You can practice this strategy by installing the SudokuCoach application on your Android™ device.
