Two-String Kite
Connect a row and a column, each with two positions for one digit, through a block to derive eliminations from their endpoints.
All candidates have been entered in the empty cells.
Candidate 5 has only two possible places in A and B. The two middle candidates cannot both be true. Therefore, at least one end of the chain is true. Candidates 5 marked × can be removed.