3 in C3 is last in column/box
3 in F9 is last in column/box
4 in D8 is last in row/box
6 in C7 is last in column/box
6 in D3 is last in column/box

1 in C8 is last in row/box

9 in B7 is last in box
9 in F8 is last in column

2 in F7 is last in box

Naked Pair 2/5 on cells {B3|C2} means
- 2/5 can be removed from A1
- 2/5 can be removed from B2

Naked Pair 1/7 on cells {E7|E9} means
- 7 can be removed from E1
- 7 can be removed from E5

If +2[B9] then -2[B3] forcing +2[G3] which removes all 2s from box 9, so B9 cannot be 2

Pair: between Box 3 and Row A:
- 2 can be removed from A4

WXYZ Wing Type 1: The four cells {E5,C5,F4,F6} contain in total 5/6/8/9 with the hinge on E5.
Non-Restricted candidate 5 determines the 'wing' cells (in yellow) and one of those 5s must be true. Therefore...
- 5 can be removed from F5

If A1 is not 7 then all candidates in G7 are removed so A1 must be 7
Depth: 6 len: 14
-7[A1]+7[D1]-2[D1]+2[J1]-2[J9]+1[J9]-1[G7]
-7[A1]+7[B2]-4[B2]+4[B6]-4[H6]+4[H7]-4[G7]
Last candidate 7 in A1 changed to solution Last candidate 2 in A8 changed to solution Last candidate 5 in A9 changed to solution Last candidate 4 in B2 changed to solution Last candidate 7 in B9 changed to solution Last candidate 1 in E9 changed to solution Last candidate 8 in G8 changed to solution Last candidate 7 in H8 changed to solution Last candidate 2 in J9 changed to solution

Last candidate 7 in E7 changed to solution

2 in D1 is last in column

Line/Box Reduction: 1s in box 8 remove the following in the same box:
- 1 can be removed from G6
- 1 can be removed from H4
- 1 can be removed from H6

If +8[J5] then -8[E5] forcing +8[E3] which removes all 8s from box 7, so J5 cannot be 8

Line/Box Reduction: 8s in box 5 remove the following in the same box:
- 8 can be removed from F4
- 8 can be removed from F6

Naked Pair 5/6 on cells {F4|F6} means
- 5 can be removed from E5
- 5 can be removed from F2
- 6 can be removed from F5

Hidden Pair 2/5 in Col 2, on cells {C2|G2}
- removes 9 from G2

Pair: between Box 7 and Row J:
- 9 can be removed from J4
- 9 can be removed from J5
- 9 can be removed from J6

(Row->Col) 5 taken off C4, based on CG25
(Row->Col) 5 taken off G3, based on CG25
(Row->Col) 5 taken off G6, based on CG25

length=4, chain ends: H7 and G3
This proves 1 is the solution at one or possibly both ends of the chain
-1[H7]+4[H7]-4[H1]+5[H1]-5[G2]+2[G2]-2[G3]+1[G3]
- 1 can be removed from G7
- 1 can be removed from H3
Last candidate 4 in G7 changed to solution Last candidate 1 in H7 changed to solution

Last candidate 9 in G6 changed to solution Last candidate 5 in G5 changed to solution

Last candidate 9 in C5 changed to solution Last candidate 8 in E5 changed to solution Last candidate 7 in F5 changed to solution Last candidate 2 in G2 changed to solution Last candidate 1 in G3 changed to solution Last candidate 5 in C2 changed to solution Last candidate 2 in C4 changed to solution Last candidate 3 in D5 changed to solution Last candidate 1 in D6 changed to solution Last candidate 5 in E3 changed to solution Last candidate 8 in F2 changed to solution Last candidate 8 in H3 changed to solution Last candidate 3 in H4 changed to solution Last candidate 4 in H6 changed to solution Last candidate 9 in J2 changed to solution Last candidate 6 in J5 changed to solution Last candidate 8 in J6 changed to solution

Last candidate 6 in A4 changed to solution Last candidate 4 in A5 changed to solution Last candidate 3 in A6 changed to solution Last candidate 2 in B3 changed to solution Last candidate 5 in B6 changed to solution Last candidate 7 in D2 changed to solution Last candidate 9 in D4 changed to solution Last candidate 9 in E1 changed to solution Last candidate 5 in F4 changed to solution Last candidate 6 in F6 changed to solution Last candidate 5 in H1 changed to solution Last candidate 4 in J1 changed to solution Last candidate 1 in J4 changed to solution Last candidate 8 in B4 changed to solution