🧩 Sudoku Solve Path Explorer

← Torna all'elenco

PDF :::: Sudoku Solve Path

File jsonD:\inetpub\webs\ruggeriinfo\public\sudoku\json\L3_2026_01_25_16_13_48439090.json
File pdfD:/inetpub/webs/ruggeriinfo/public/sudoku/pdf/L3_2026_01_25_16_13_48439090_8_8.pdf

← Torna all'elenco

Sudoku Solve Path

GradoDiabolical Livello5 (precedente: 5)
Punteggio finale8.8 Punteggio precedente155
Indizi25 # Passi26
Versione generatoreversion 3.74, 25-Jan-2026
Soluzione983657412256814397174932568529173846348269175617548239432786951795321684861495723
FileD:\inetpub\webs\ruggeriinfo\public\sudoku\json\L3_2026_01_25_16_13_48439090.json

Passi risolutivi (26)

Passo 1 Hidden Singles valore: 5.3 categoria doc: Getting_Started
3 in E1 is last in column/box
5 in H3 is last in box
6 in B3 is last in row/column/box
9 in G7 is last in column/box
9 in J5 is last in row
Passo 2 Hidden Singles valore: 4.2 categoria doc: Getting_Started
2 in B1 is last in column
2 in J8 is last in row
4 in C3 is last in column
6 in H7 is last in column/box
7 in H1 is last in row/box
9 in A1 is last in row
9 in C4 is last in box
Passo 3 Hidden Singles valore: 3.6 categoria doc: Getting_Started
3 in J9 is last in row
4 in G1 is last in column/box
Passo 4 Hidden Singles valore: 3.2 categoria doc: Getting_Started
3 in B7 is last in box
3 in C5 is last in row
Passo 5 Pointing Pairs valore: 44.2 categoria doc: Intersection_Removal
Pair: between Box 2 and Row B:
- 1 can be removed from B2
Passo 6 Pointing Pairs valore: 43.7 categoria doc: Intersection_Removal
Pair: between Box 9 and Col 8:
- 1 can be removed from E9
Passo 7 Pointing Pairs valore: 42.9 categoria doc: Intersection_Removal
Pair: between Box 1 and Col 1:
- 7 can be removed from D2
- 7 can be removed from F2
Passo 8 Rectangle Elimination valore: 70.8 categoria doc: Rectangle_Elimination
If +4[D7] then -4[A7] forcing +4[A5] which removes all 4s from box 5, so D7 cannot be 4
Passo 9 Naked Pair valore: 13.8 categoria doc: Naked_Candidates
Naked Pair 2/8 on cells {D2|D7} means
- 8 can be removed from D3
- 2 can be removed from D5
- 8 can be removed from D8
Passo 10 Line/Box Reduction valore: 53.9 categoria doc: Intersection_Removal
Pair: between Col 8 and Box 8:
- 8 can be removed from G9
- 8 can be removed from H9
Passo 11 Y-Wing valore: 106.7 categoria doc: Y_Wing_Strategy
Y-Wing pattern. Hinge: E9 (5/8), wings D7 E4, therefore
- 2 can be removed from E7
Passo 12 Line/Box Reduction valore: 52.3 categoria doc: Intersection_Removal
Pair: between Row F and Box 4:
- 2 can be removed from F4
- 2 can be removed from F5
Passo 13 3D Medusa valore: 206.9 categoria doc: 3D_Medusa
(RULE 4): Uncoloured candidate 8 in A5 can see two different coloured candidates of 8 elsewhere.
Passo 14 Pointing Pairs valore: 38 categoria doc: Intersection_Removal
Pair: between Box 2 and Row B:
- 8 can be removed from B2
- 8 can be removed from B9
Passo 15 Naked Triple valore: 49 categoria doc: Naked_Candidates
Naked Triple 4/5/7 on cells {A5|D5|F5} means
- 4/5 can be removed from B5
- 5 can be removed from E5
Passo 16 X-Wing valore: 71.8 categoria doc: X_Wing_Strategy
(Col->Row) 8 taken off C2, based on AD27
(Col->Row) 8 taken off E7, based on AD27
Last candidate 1 in E7 changed to solution
Passo 17 XYZ Wing valore: 137 categoria doc: XYZ_Wing
XYZ-Wing pattern. Hinge: G5 (1/6/8), wings B5 G6, therefore
- 1 can be removed from H5
Passo 18 XY-Chain valore: 211.7 categoria doc: XY_Chains
length=7, chain ends: D5 and F3
This proves 7 is the solution at one or possibly both ends of the chain
-7[D5]+4[D5]-4[A5]+5[A5]-5[A2]+8[A2]-8[C1]+1[C1]-1[J1]+8[J1]-8[J3]+1[J3]-1[F3]+7[F3]
- 7 can be removed from D3
- 7 can be removed from F5
Last candidate 9 in D3 changed to solution
Passo 19 Naked Singles valore: 1.1 categoria doc: Getting_Started
Last candidate 8 in E3 changed to solution
Passo 20 Naked Singles valore: 1 categoria doc: Getting_Started
Last candidate 2 in D2 changed to solution Last candidate 5 in E9 changed to solution Last candidate 1 in J3 changed to solution
Passo 21 Naked Singles valore: 0.9 categoria doc: Getting_Started
Last candidate 8 in D7 changed to solution Last candidate 2 in E4 changed to solution Last candidate 1 in F2 changed to solution Last candidate 7 in F3 changed to solution Last candidate 1 in G9 changed to solution Last candidate 8 in J1 changed to solution
Passo 22 Naked Singles valore: 0.7 categoria doc: Getting_Started
Last candidate 4 in A7 changed to solution Last candidate 1 in C1 changed to solution Last candidate 7 in C2 changed to solution Last candidate 6 in E5 changed to solution Last candidate 6 in G6 changed to solution Last candidate 4 in H9 changed to solution
Passo 23 Naked Singles valore: 0.5 categoria doc: Getting_Started
Last candidate 5 in A5 changed to solution Last candidate 5 in B2 changed to solution Last candidate 7 in B9 changed to solution Last candidate 8 in C9 changed to solution Last candidate 9 in E6 changed to solution Last candidate 2 in F7 changed to solution Last candidate 8 in G5 changed to solution Last candidate 8 in H8 changed to solution
Passo 24 Naked Singles valore: 0.3 categoria doc: Getting_Started
Last candidate 8 in A2 changed to solution Last candidate 8 in B4 changed to solution Last candidate 1 in B5 changed to solution Last candidate 4 in F5 changed to solution Last candidate 5 in G8 changed to solution Last candidate 3 in H4 changed to solution Last candidate 2 in H5 changed to solution
Passo 25 Naked Singles valore: 0.1 categoria doc: Getting_Started
Last candidate 4 in B6 changed to solution Last candidate 7 in D5 changed to solution Last candidate 3 in D6 changed to solution Last candidate 5 in F4 changed to solution Last candidate 3 in F8 changed to solution Last candidate 1 in H6 changed to solution
Passo 26 Naked Singles valore: 0 categoria doc: Getting_Started
Last candidate 4 in D8 changed to solution