1 in F1 is last in row/box
2 in A9 is last in row/box
3 in F7 is last in row/column/box
3 in H6 is last in row
3 in J1 is last in column/box
4 in C7 is last in column/box
5 in E9 is last in row/box

3 in C4 is last in row/column/box
9 in D9 is last in column/box
9 in E5 is last in row

2 in D4 is last in box

2 in J5 is last in row

1 in J4 is last in row/box

Hidden Pair 4/7 in Box 4, on cells {D3|F2}
- removes 6 from D3
- removes 6/8 from F2

Naked Pair 4/7 on cells {F2|H2} means
- 7 can be removed from J2
Last candidate 6 in J2 changed to solution

Naked Pair 8/9 on cells {A2|B2} means
- 8 can be removed from C1

Pair: between Box 5 and Col 6:
- 6 can be removed from A6
- 6 can be removed from C6

Hidden Pair 1/6 in Row A, on cells {A5|A8}
- removes 4/8 from A5
- removes 8 from A8

Line/Box Reduction: 4s in box 8 remove the following in the same box:
- 4 can be removed from G4
- 4 can be removed from G6

If either +5[B3] or +5[G4] are ON then both are on because they are strongly linked through the hinge cell B4. If both are ON then this removes all 5s from box 7, so neither can be 5

5 in B4 is last in row/column

9 in B2 is last in row

Last candidate 8 in A2 changed to solution

1 cannot be set in the yellow cells {C7,C8,C9} and with the Remote Pair in A5 and B3 it means:
- 6 can be removed from B5

If +7[H8] then -7[D8] forcing +7[D3] which removes all 7s from box 7, so H8 cannot be 7

X-CYCLE on 7 (Discontinuous Alternating Nice Loop, length 8):
+7[H5]-7[J6]+7[J8]-7[D8]+7[F9]-7[F2]+7[H2]-7[H5]
- Contradiction: When H5 is set to 7 the chain implies it cannot be 7 - it can be removed

length=4, chain ends: F4 and H5
This proves 8 is the solution at one or possibly both ends of the chain
-8[F4]+4[F4]-4[F2]+7[F2]-7[H2]+4[H2]-4[H5]+8[H5]
- 8 can be removed from G4
Last candidate 9 in G4 changed to solution

Last candidate 4 in A4 changed to solution Last candidate 9 in A6 changed to solution Last candidate 8 in F4 changed to solution

(Row->Col) 8 taken off C5, based on CG69
(Row->Col) 8 taken off G5, based on CG69
(Row->Col) 8 taken off G7, based on CG69

length=4, chain ends: H8 and J6
This proves 5 is the solution at one or possibly both ends of the chain
-5[H8]+8[H8]-8[H5]+4[H5]-4[G5]+7[G5]-7[J6]+5[J6]
- 5 can be removed from J8
Last candidate 7 in J8 changed to solution

Last candidate 5 in J6 changed to solution

5 in H8 is last in column/box
7 in B7 is last in column
7 in D3 is last in row
7 in F9 is last in box

Last candidate 4 in D6 changed to solution

Y-Wing pattern. Hinge: E7 (6/8), wings E3 H7, therefore
- 2 can be removed from H3
Last candidate 4 in H3 changed to solution Last candidate 8 in H5 changed to solution Last candidate 2 in H7 changed to solution

Last candidate 1 in B5 changed to solution Last candidate 7 in G6 changed to solution Last candidate 6 in G7 changed to solution Last candidate 8 in G9 changed to solution Last candidate 6 in A5 changed to solution Last candidate 1 in A8 changed to solution Last candidate 6 in B3 changed to solution Last candidate 8 in B8 changed to solution Last candidate 5 in C1 changed to solution Last candidate 1 in C3 changed to solution Last candidate 7 in C5 changed to solution Last candidate 8 in C6 changed to solution Last candidate 6 in C9 changed to solution Last candidate 6 in D8 changed to solution Last candidate 2 in E3 changed to solution Last candidate 8 in E7 changed to solution Last candidate 2 in G1 changed to solution Last candidate 5 in G3 changed to solution Last candidate 4 in G5 changed to solution

Last candidate 8 in D1 changed to solution Last candidate 6 in E1 changed to solution