2-String Kite
To find the correct 2-string kite chain, you need to find a row and a column that each contain exactly two instances of the same candidate
- Have a look at this example
- One candidate from the row and one candidate from the column must be in the same block
- We have a 2-string kite where the candidate at one end is true and the candidate at the other end is false. In this case, the candidate that can see both ends of the string kite can be eliminated.
