🧩 Sudoku Solve Path Explorer

← Torna all'elenco

PDF :::: Sudoku Solve Path

File jsonD:\inetpub\webs\ruggeriinfo\public\sudoku\json\L4_16_08_2026_2026_09_02_13_08_55213787.json
File pdfD:/inetpub/webs/ruggeriinfo/public/sudoku/pdf/L4_16_08_2026_2026_09_02_13_08_55213787_9_7.pdf

← Torna all'elenco

Sudoku Solve Path

GradoDiabolical Livello6 (precedente: 5)
Punteggio finale9.7 Punteggio precedente401
Indizi24 # Passi38
Versione generatoreversion 4.25, 25-Aug-2026
Soluzione638259147579431682241768593756183924183942765492576831865327419314895276927614358
FileD:\inetpub\webs\ruggeriinfo\public\sudoku\json\L4_16_08_2026_2026_09_02_13_08_55213787.json

Passi risolutivi (38)

Passo 1 Hidden Singles valore: 5.7 categoria doc: Getting_Started
1 in J5 is last in row/box
8 in C6 is last in column/box
9 in F2 is last in row/box
Passo 2 Hidden Singles valore: 5.3 categoria doc: Getting_Started
2 in G5 is last in column/box
2 in J2 is last in row
6 in F6 is last in column
Passo 3 Hidden Singles valore: 4.8 categoria doc: Getting_Started
2 in B9 is last in row
2 in C1 is last in column/box
9 in G9 is last in row
9 in H5 is last in column/box
Passo 4 Hidden Singles valore: 4.3 categoria doc: Getting_Started
2 in D8 is last in row/column/box
9 in B3 is last in row
9 in C8 is last in column/box
Passo 5 Hidden Pair valore: 40.4 categoria doc: Hidden_Candidates
Hidden Pair 6/7 in Box 6, on cells {E7|E8}
- removes 1/3/4/5/8 from E7
- removes 3/4 from E8
Passo 6 Naked Pair valore: 19.8 categoria doc: Naked_Candidates
Naked Pair 6/7 on cells {E7|E8} means
- 7 can be removed from E1
- 7 can be removed from E2
- 7 can be removed from E3
Passo 7 Pointing Pairs valore: 59 categoria doc: Intersection_Removal
Pair: between Box 2 and Col 4:
- 7 can be removed from G4
Passo 8 Line/Unit Reduction valore: 77.6 categoria doc: Intersection_Removal
Line/Box Reduction: 4s in box 6 remove the following in the same box:
- 4 can be removed from F7
- 4 can be removed from F8
Last candidate 3 in F8 changed to solution
Passo 9 Forcing Nets valore: 326.8 categoria doc: Forcing_Nets
If D6 is not 3 then both candidates in J9 are ON so D6 must be 3
Depth: 9 len: 20
-3[D6]+5[D6]-5[D2]+7[D2]-7[B2]+7[B4]-7[C4]+3[C4]-3[C9]+3[J9]
-3[D6]+5[D6]-5[D2]+7[D2]-7[B2]+7[C3]-7[J3]+7[J7]-8[J7]+8[J9]
Last candidate 3 in D6 changed to solution
Passo 10 Hidden Singles valore: 3.4 categoria doc: Getting_Started
3 in G4 is last in box
Passo 11 Pointing Pairs valore: 48.7 categoria doc: Intersection_Removal
Pair: between Box 9 and Row J:
- 3 can be removed from J3
Passo 12 Naked Triple valore: 61.6 categoria doc: Naked_Candidates
Naked Triple 1/7/8 on cells {A3|C3|J3} means
- 1 can be removed from A1
- 1/8 can be removed from E3
- 7/8 can be removed from G3
- 7 can be removed from H3
Passo 13 W-Wing valore: 76.3 categoria doc: W_Wings
W-Wing (single). Either there is a 5 in C4 or in D2. They are connected through 7 in B4/B2, therefore
- 5 can be removed from D4
Passo 14 Rectangle Elimination valore: 75.7 categoria doc: Rectangle_Elimination
If +5[F7] then -5[A7] forcing +5[A5] which removes all 5s from Box 5, so F7 cannot be 5
Passo 15 Pointing Pairs valore: 45 categoria doc: Intersection_Removal
Triple: between Box 6 and Col 9:
- 5 can be removed from C9
Passo 16 XY-Chain valore: 191.3 categoria doc: XY_Chains
length=4, chain ends: A1 and E2
This proves 8 is the solution at one or possibly both ends of the chain
-8[A1]+6[A1]-6[B2]+7[B2]-7[D2]+5[D2]-5[E2]+8[E2]
- 8 can be removed from E1
- 8 can be removed from F1
Passo 17 Hidden Singles valore: 2.9 categoria doc: Getting_Started
8 in E2 is last in box
Passo 18 Hidden Pair valore: 27.8 categoria doc: Hidden_Candidates
Hidden Pair 6/8 in Col 1, on cells {A1|G1}
- removes 4/7 from G1
Passo 19 XY-Chain valore: 177 categoria doc: XY_Chains
length=4. This XY-Chain is continuous and one value in each cell must be the solution, so all off-chain candidates can be removed
-1[C3]+7[C3]-7[J3]+8[J3]-8[J9]+3[J9]-3[C9]+1[C9]
- 8 can be removed from J7
- 1 can be removed from C7
Passo 20 XY-Chain valore: 256.1 categoria doc: XY_Chains
length=7, chain ends: A1 and E7
This proves 6 is the solution at one or possibly both ends of the chain
-6[A1]+8[A1]-8[A3]+1[A3]-1[C3]+7[C3]-7[J3]+8[J3]-8[J9]+3[J9]-3[J7]+7[J7]-7[E7]+6[E7]
- 6 can be removed from A7
Passo 21 XY-Chain valore: 277.3 categoria doc: XY_Chains
length=8. This XY-Chain is continuous and one value in each cell must be the solution, so all off-chain candidates can be removed
-6[A1]+8[A1]-8[A3]+1[A3]-1[C3]+7[C3]-7[J3]+8[J3]-8[J9]+3[J9]-3[J7]+7[J7]-7[H8]+4[H8]-4[A8]+6[A8]
- 7 can be removed from G7
- 6 can be removed from A5
Passo 22 Naked Pair valore: 12.9 categoria doc: Naked_Candidates
Naked Pair 4/5 on cells {A5|E5} means
- 4 can be removed from B5
- 5 can be removed from C5
Passo 23 X-Cycle valore: 191.9 categoria doc: X_Cycles
X-CYCLE Rule 3 (Discontinuous Alternating Nice Loop, length 8):
+4[E3]-4[E5]+4[A5]-4[B4]+4[B7]-4[G7]+4[G3]-4[E3]
- Contradiction: When E3 is set to 4 the chain implies it cannot be 4 - it can be removed
Passo 24 Pointing Pairs valore: 38 categoria doc: Intersection_Removal
Triple: between Box 4 and Col 1:
- 4 can be removed from H1
Passo 25 XY-Chain valore: 160.9 categoria doc: XY_Chains
length=4, chain ends: C9 and B5
This proves 3 is the solution at one or possibly both ends of the chain
-3[C9]+1[C9]-1[C3]+7[C3]-7[B2]+6[B2]-6[B5]+3[B5]
- 3 can be removed from B7
- 3 can be removed from C5
Last candidate 6 in C5 changed to solution
Passo 26 Naked Singles valore: 1.2 categoria doc: Getting_Started
Last candidate 3 in B5 changed to solution
Passo 27 Naked Pair valore: 11.7 categoria doc: Naked_Candidates
Naked Pair 4/6 on cells {A8|B7} means
- 4 can be removed from A7
Passo 28 XY-Chain valore: 148.4 categoria doc: XY_Chains
length=4, chain ends: D4 and F7
This proves 1 is the solution at one or possibly both ends of the chain
-1[D4]+4[D4]-4[E5]+4[A5]-5[A5]+5[A7]-1[A7]+1[F7]
- 1 can be removed from D9
- 1 can be removed from F4
Passo 29 Hidden Singles valore: 2.3 categoria doc: Getting_Started
1 in D4 is last in column/box
Passo 30 Chute Remote Pair valore: 54.3 categoria doc: Chute_Remote_Pairs
5 cannot be set in the yellow cells {F1,F2,F3} and with the Remote Pair in D9 and E5 it means:
- 4 can be removed from E9
Passo 31 W-Wing valore: 53 categoria doc: W_Wings
W-Wing (single). Either there is a 1 in A7 or in E9. They are connected through 5 in A5/E5, therefore
- 1 can be removed from C9
- 1 can be removed from F7
Last candidate 3 in C9 changed to solution
Last candidate 8 in F7 changed to solution
Passo 32 Naked Singles valore: 0.9 categoria doc: Getting_Started
Last candidate 5 in C7 changed to solution
Last candidate 4 in G7 changed to solution
Last candidate 8 in J9 changed to solution
Passo 33 Naked Singles valore: 0.6 categoria doc: Getting_Started
Last candidate 1 in A7 changed to solution
Last candidate 6 in B7 changed to solution
Last candidate 7 in C4 changed to solution
Last candidate 5 in G3 changed to solution
Last candidate 7 in H8 changed to solution
Last candidate 7 in J3 changed to solution
Passo 34 Naked Singles valore: 0.3 categoria doc: Getting_Started
Last candidate 8 in A3 changed to solution
Last candidate 4 in A8 changed to solution
Last candidate 7 in B2 changed to solution
Last candidate 4 in B4 changed to solution
Last candidate 1 in C3 changed to solution
Last candidate 3 in E3 changed to solution
Last candidate 7 in E7 changed to solution
Last candidate 6 in E8 changed to solution
Last candidate 6 in G2 changed to solution
Last candidate 7 in G6 changed to solution
Last candidate 3 in H1 changed to solution
Last candidate 5 in H6 changed to solution
Last candidate 3 in J7 changed to solution
Passo 35 Naked Singles valore: 0.2 categoria doc: Getting_Started
Last candidate 6 in A1 changed to solution
Last candidate 5 in A5 changed to solution
Last candidate 5 in D2 changed to solution
Last candidate 5 in F4 changed to solution
Last candidate 8 in G1 changed to solution
Last candidate 4 in H3 changed to solution
Passo 36 Naked Singles valore: 0.1 categoria doc: Getting_Started
Last candidate 4 in D9 changed to solution
Last candidate 4 in E5 changed to solution
Passo 37 Naked Singles valore: 0 categoria doc: Getting_Started
Last candidate 7 in D1 changed to solution
Last candidate 1 in E1 changed to solution
Last candidate 1 in F9 changed to solution
Passo 38 Naked Singles valore: 0 categoria doc: Getting_Started
Last candidate 5 in E9 changed to solution
Last candidate 4 in F1 changed to solution