R1C7 can only be <3>

R7C1 can only be <9>

R3C7 is the only square in row 3 that can be <6>

R6C5 is the only square in row 6 that can be <6>

R5C1 is the only square in row 5 that can be <6>

R7C7 is the only square in row 7 that can be <2>

R8C8 is the only square in row 8 that can be <6>

R2C1 is the only square in column 1 that can be <2>

R7C3 is the only square in column 3 that can be <7>

Intersection of row 7 with block 8. The value <1> only appears in one or more of squares R7C4, R7C5 and R7C6 of row 7. These squares are the ones that intersect with block 8. Thus, the other (non-intersecting) squares of block 8 cannot contain this value.

R9C5 - removing <1> from <1489> leaving <489>

Intersection of column 7 with block 6. The value <5> only appears in one or more of squares R4C7, R5C7 and R6C7 of column 7. These squares are the ones that intersect with block 6. Thus, the other (non-intersecting) squares of block 6 cannot contain this value.

R4C8 - removing <5> from <135> leaving <13>

R5C8 - removing <5> from <1235> leaving <123>

R5C9 - removing <5> from <1359> leaving <139>

R6C8 - removing <5> from <258> leaving <28>

R2C8 is the only square in column 8 that can be <5>

R3C3 is the only square in row 3 that can be <5>

R6C3 can only be <9>

R1C8 is the only square in column 8 that can be <7>

Squares R2C9 and R3C9 in column 9 form a simple locked pair. These 2 squares both contain the 2 possibilities <18>. Since each of the squares must contain one of the possibilities, they can be eliminated from the other squares in the column.

R5C9 - removing <1> from <139> leaving <39>

R7C9 - removing <8> from <58> leaving <5>

R8C9 - removing <8> from <3589> leaving <359>

R7C4 can only be <1>

R7C6 can only be <8>

R3C9 is the only square in row 3 that can be <8>

R2C9 can only be <1>

R2C5 is the only square in row 2 that can be <8>

R2C6 is the only square in row 2 that can be <7>

R3C6 is the only square in row 3 that can be <1>

R8C5 is the only square in row 8 that can be <7>

R8C4 is the only square in row 8 that can be <5>

R8C2 is the only square in row 8 that can be <8>

Squares R5C4 and R5C6 in row 5 form a simple locked pair. These 2 squares both contain the 2 possibilities <49>. Since each of the squares must contain one of the possibilities, they can be eliminated from the other squares in the row.

R5C2 - removing <4> from <2345> leaving <235>

R5C5 - removing <49> from <1459> leaving <15>

R5C9 - removing <9> from <39> leaving <3>

R8C9 can only be <9>

R4C8 can only be <1>

R8C6 can only be <4>

R9C7 can only be <8>

R9C8 can only be <3>

R6C7 can only be <5>

R5C8 can only be <2>

R5C2 can only be <5>

R6C8 can only be <8>

R6C2 can only be <2>

R4C7 can only be <9>

R8C1 can only be <3>

R5C6 can only be <9>

R9C5 can only be <9>

R1C5 can only be <4>

R1C3 can only be <1>

R4C5 can only be <5>

R3C4 can only be <3>

R3C1 can only be <4>

R2C4 can only be <9>

R5C5 can only be <1>

R5C4 can only be <4>

R1C2 can only be <9>

R9C3 can only be <4>

R2C2 can only be <3>

R9C2 can only be <1>

R4C3 can only be <3>

R4C2 can only be <4>