🧩 Sudoku Solve Path Explorer

← Torna all'elenco

PDF :::: Sudoku Solve Path

File jsonD:\inetpub\webs\ruggeriinfo\public\sudoku\json\L4_19_07_2026_2026_07_24_13_53_0585759.json
File pdfD:/inetpub/webs/ruggeriinfo/public/sudoku/pdf/L4_19_07_2026_2026_07_24_13_53_0585759_8_8.pdf

← Torna all'elenco

Sudoku Solve Path

GradoDiabolical Livello5 (precedente: 5)
Punteggio finale8.8 Punteggio precedente299
Indizi24 # Passi33
Versione generatoreversion 4.21, 22-Jul-2026
Soluzione186953274947612385523784619315268497768495123492371856674829531831547962259136748
FileD:\inetpub\webs\ruggeriinfo\public\sudoku\json\L4_19_07_2026_2026_07_24_13_53_0585759.json

Passi risolutivi (33)

Passo 1 Hidden Singles valore: 6.1 categoria doc: Getting_Started
3 in E9 is last in column/box
9 in B1 is last in row/box
Passo 2 Hidden Singles valore: 5.8 categoria doc: Getting_Started
5 in C1 is last in column/box
Passo 3 Pointing Pairs valore: 84.6 categoria doc: Intersection_Removal
Pair: between Box 2 and Row A:
- 5 can be removed from A7
- 5 can be removed from A9
Passo 4 Pointing Pairs valore: 83.4 categoria doc: Intersection_Removal
Pair: between Box 4 and Row E:
- 8 can be removed from E4
- 8 can be removed from E5
- 8 can be removed from E6
Passo 5 Line/Unit Reduction valore: 108.9 categoria doc: Intersection_Removal
Line/Box Reduction: 4s in box 4 remove the following in the same box:
- 4 can be removed from D2
- 4 can be removed from E2
- 4 can be removed from E3
- 4 can be removed from F3
Last candidate 2 in F3 changed to solution
Passo 6 Hidden Singles valore: 5 categoria doc: Getting_Started
2 in C2 is last in box
Passo 7 Hidden Singles valore: 4.8 categoria doc: Getting_Started
3 in H2 is last in column
Passo 8 Naked Singles valore: 2.3 categoria doc: Getting_Started
Last candidate 9 in J3 changed to solution
Passo 9 Rectangle Elimination valore: 115.5 categoria doc: Rectangle_Elimination
If +1[D4] then -1[D9] forcing +1[G9] which removes all 1s from Box 8, so D4 cannot be 1
Passo 10 X-Cycle valore: 344.6 categoria doc: X_Cycles
X-CYCLE on 1 (Discontinuous Alternating Nice Loop, length 8):
+1[E4]-1[E2]+1[D2]-1[D9]+1[G9]-1[J7]+1[J4]-1[E4]
- Contradiction: When E4 is set to 1 the chain implies it cannot be 1 - it can be removed
Passo 11 Forcing Nets valore: 137 categoria doc: Forcing_Nets
If B9 is not 5 then candidates 1 in Box 6 are both ON so B9 must be 5
Depth: 3 len: 8
-5[B9]+5[G9]-1[G9]+1[D9]
-5[B9]+5[B8]-5[F8]+1[F8]
Last candidate 5 in B9 changed to solution
Passo 12 Hidden Singles valore: 4.4 categoria doc: Getting_Started
5 in G7 is last in row/box
Passo 13 Hidden Singles valore: 4.2 categoria doc: Getting_Started
9 in H7 is last in column/box
Passo 14 Hidden Singles valore: 4.2 categoria doc: Getting_Started
6 in H8 is last in row/box
Passo 15 Naked Singles valore: 2 categoria doc: Getting_Started
Last candidate 8 in B8 changed to solution
Passo 16 Naked Singles valore: 1.9 categoria doc: Getting_Started
Last candidate 1 in C8 changed to solution
Passo 17 Naked Singles valore: 1.9 categoria doc: Getting_Started
Last candidate 5 in F8 changed to solution
Passo 18 Naked Singles valore: 1.8 categoria doc: Getting_Started
Last candidate 2 in E8 changed to solution
Passo 19 Hidden Pair valore: 34.7 categoria doc: Hidden_Candidates
Hidden Pair 5/9 in Box 5, on cells {E5|E6}
- removes 6/7 from E5
- removes 1/4/7 from E6
Passo 20 Line/Unit Reduction valore: 68.8 categoria doc: Intersection_Removal
Line/Box Reduction: 1s in box 5 remove the following in the same box:
- 1 can be removed from D6
Passo 21 Rectangle Elimination valore: 85.3 categoria doc: Rectangle_Elimination
If +6[D2] then -6[B2] forcing +6[B4] which removes all 6s from Box 5, so D2 cannot be 6
Passo 22 Hidden Pair valore: 32.7 categoria doc: Hidden_Candidates
Hidden Pair 2/6 in Row D, on cells {D4|D5}
- removes 4/7/8 from D4
- removes 7/8 from D5
Passo 23 Hidden Singles valore: 3.2 categoria doc: Getting_Started
8 in D6 is last in row/box
Passo 24 Naked Singles valore: 1.4 categoria doc: Getting_Started
Last candidate 7 in H6 changed to solution
Passo 25 Naked Singles valore: 1.3 categoria doc: Getting_Started
Last candidate 2 in H9 changed to solution
Passo 26 Naked Singles valore: 1.2 categoria doc: Getting_Started
Last candidate 4 in A9 changed to solution
Last candidate 8 in H1 changed to solution
Passo 27 Naked Singles valore: 1.1 categoria doc: Getting_Started
Last candidate 6 in C7 changed to solution
Last candidate 4 in G3 changed to solution
Passo 28 Naked Singles valore: 1 categoria doc: Getting_Started
Last candidate 2 in A7 changed to solution
Last candidate 3 in C3 changed to solution
Last candidate 7 in G2 changed to solution
Passo 29 Naked Singles valore: 0.7 categoria doc: Getting_Started
Last candidate 6 in A3 changed to solution
Last candidate 4 in C6 changed to solution
Last candidate 1 in D2 changed to solution
Last candidate 1 in G9 changed to solution
Last candidate 2 in J1 changed to solution
Passo 30 Naked Singles valore: 0.5 categoria doc: Getting_Started
Last candidate 4 in B2 changed to solution
Last candidate 6 in B4 changed to solution
Last candidate 7 in D9 changed to solution
Last candidate 6 in E2 changed to solution
Last candidate 8 in E3 changed to solution
Last candidate 9 in G6 changed to solution
Last candidate 3 in J5 changed to solution
Last candidate 7 in J7 changed to solution
Passo 31 Naked Singles valore: 0.2 categoria doc: Getting_Started
Last candidate 5 in A5 changed to solution
Last candidate 2 in D4 changed to solution
Last candidate 4 in D7 changed to solution
Last candidate 5 in E6 changed to solution
Last candidate 7 in F5 changed to solution
Last candidate 1 in J4 changed to solution
Passo 32 Naked Singles valore: 0.1 categoria doc: Getting_Started
Last candidate 3 in A6 changed to solution
Last candidate 8 in C5 changed to solution
Last candidate 6 in D5 changed to solution
Last candidate 4 in E4 changed to solution
Last candidate 9 in E5 changed to solution
Last candidate 1 in E7 changed to solution
Last candidate 4 in F1 changed to solution
Last candidate 8 in G4 changed to solution
Passo 33 Naked Singles valore: 0 categoria doc: Getting_Started
Last candidate 7 in C4 changed to solution
Last candidate 7 in E1 changed to solution
Last candidate 3 in F4 changed to solution
Last candidate 1 in F6 changed to solution
Last candidate 2 in G5 changed to solution