Last candidate 7 in G2 changed to solution

3 in H2 is last in row
3 in J8 is last in column/box
6 in A7 is last in row/box
6 in G5 is last in row/box
8 in A2 is last in row/column/box

4 in H9 is last in row
4 in J3 is last in box
8 in J4 is last in box

Last candidate 9 in J7 changed to solution Last candidate 7 in J6 changed to solution

Naked Pair 5/9 on cells {A1|A6} means
- 9 can be removed from A3
- 5 can be removed from A4

Pair: between Box 4 and Row D:
- 1 can be removed from D9

Pair: between Box 5 and Row D:
- 5 can be removed from D2

Neither 1/7 can be set in the yellow cells {B1,B2,B3} and with the Remote Pair in A4 and C9 it means:
- 1/7 can be removed from C5
1 can be taken off C7 ('either end' rule)
1/7 can be taken off C8 ('either end' rule)

Naked Pair 2/5 on cells {C7|C8} means
- 5 can be removed from B8
- 5 can be removed from C1
- 5 can be removed from C2

5 in E2 is last in column

length=6, chain ends: D3 and H4
This proves 2 is the solution at one or possibly both ends of the chain
-2[D3]+1[D3]-1[D2]+4[D2]-4[C2]+1[C2]-1[A3]+7[A3]-7[A4]+1[A4]-1[H4]+2[H4]
- 2 can be removed from D4
Last candidate 5 in D4 changed to solution

length=7, chain ends: B6 and C2
This proves 4 is the solution at one or possibly both ends of the chain
-4[B6]+5[B6]-5[A6]+9[A6]-9[H6]+2[H6]-2[H4]+1[H4]-1[A4]+7[A4]-7[A3]+1[A3]-1[C2]+4[C2]
- 4 can be removed from B1
- 4 can be removed from C5

length=8, chain ends: A1 and G3
This proves 9 is the solution at one or possibly both ends of the chain
-9[A1]+5[A1]-5[A6]+9[A6]-9[H6]+2[H6]-2[H4]+1[H4]-1[A4]+7[A4]-7[A3]+1[A3]-1[D3]+2[D3]-2[G3]+9[G3]
- 9 can be removed from C3
- 9 can be removed from G1
Last candidate 2 in G1 changed to solution Last candidate 9 in G3 changed to solution

(RULE 1): Two candidates in B5 have the same color - all yellow coloured candidates can be removed
Last candidate 9 in A1 changed to solution Last candidate 5 in A6 changed to solution Last candidate 5 in B1 changed to solution Last candidate 4 in B6 changed to solution Last candidate 9 in C5 changed to solution Last candidate 2 in H4 changed to solution Last candidate 1 in H5 changed to solution Last candidate 9 in H6 changed to solution

length=6, chain ends: C2 and G9
This proves 1 is the solution at one or possibly both ends of the chain
-1[C2]+4[C2]-4[D2]+1[D2]-1[D3]+2[D3]-2[D6]+6[D6]-6[D9]+8[D9]-8[G9]+1[G9]
- 1 can be removed from C9
Last candidate 7 in C9 changed to solution

Last candidate 1 in B8 changed to solution

1 in A4 is last in column/box
1 in F7 is last in row/box
1 in G9 is last in column
7 in A3 is last in column/box

Last candidate 2 in C7 changed to solution Last candidate 5 in C8 changed to solution Last candidate 4 in E7 changed to solution

Uniqueness Type 1 removing 3/7 at F5 because of B5,B4,F4
Last candidate 4 in F5 changed to solution

Last candidate 8 in D5 changed to solution Last candidate 6 in D9 changed to solution Last candidate 8 in E9 changed to solution Last candidate 2 in D6 changed to solution Last candidate 6 in F6 changed to solution

Last candidate 1 in D3 changed to solution Last candidate 3 in F1 changed to solution Last candidate 7 in F4 changed to solution Last candidate 2 in F8 changed to solution Last candidate 3 in B4 changed to solution Last candidate 7 in B5 changed to solution Last candidate 4 in C1 changed to solution Last candidate 1 in C2 changed to solution Last candidate 3 in C3 changed to solution Last candidate 4 in D2 changed to solution Last candidate 6 in E1 changed to solution Last candidate 2 in E3 changed to solution Last candidate 3 in E5 changed to solution Last candidate 7 in E8 changed to solution