Is this technique already invented yet? It cannot solve sudoku, but I find this technique very useful:
We focus at a single digit. Two homes are connected for a digit n if there are two candidates on each home sharing the same row/column. Note that this relation is generally not transitive.
Then a digit n is entangled if there is a loop of connected homes A > B > C > ... > D > A for that digit so that the homes are not collinear. (i.e. A and B is connected, B and C is connected, ..., ... and D is connected, and D and A is connected for that digit, and all homes are not from the same row or column).
An unentangled digit will remain unentangled forever.
An unentangled digit means that after single and intersection rule, pattern overlay will fail to remove any candidate, so it's best to leave an unentangled digit alone and focus on the sill entangled digit.
This is also useful for a pattern overlay shortcut as all digits in an unentangled pattern will be overlaid. Also, when there are two homes that is connected and neither is connected to another home from the same row/column and one of them is not connected to any other home, you can ignore the row/column (of the same axis) placement of the candidate and only concentrate on the column/row (of different axis) of the candidate. on that home.