🧩 Sudoku Solve Path Explorer

← Torna all'elenco

PDF :::: Sudoku Solve Path

File jsonD:\inetpub\webs\ruggeriinfo\public\sudoku\json\L4_28_08_2026_2026_09_02_13_20_42372440.json
File pdfD:/inetpub/webs/ruggeriinfo/public/sudoku/pdf/L4_28_08_2026_2026_09_02_13_20_42372440_9_3.pdf

← Torna all'elenco

Sudoku Solve Path

GradoDiabolical Livello5 (precedente: 5)
Punteggio finale9.3 Punteggio precedente485
Indizi24 # Passi36
Versione generatoreversion 4.25, 25-Aug-2026
Soluzione516347298973812465428569137637195824154238679289476351791624583365981742842753916
FileD:\inetpub\webs\ruggeriinfo\public\sudoku\json\L4_28_08_2026_2026_09_02_13_20_42372440.json

Passi risolutivi (36)

Passo 1 Naked Singles valore: 1 categoria doc: Getting_Started
Last candidate 8 in E6 changed to solution
Passo 2 Naked Singles valore: 2 categoria doc: Getting_Started
Last candidate 2 in E4 changed to solution
Last candidate 4 in G6 changed to solution
Passo 3 Naked Singles valore: 2.4 categoria doc: Getting_Started
Last candidate 9 in C6 changed to solution
Last candidate 1 in D4 changed to solution
Last candidate 6 in E7 changed to solution
Last candidate 1 in H6 changed to solution
Passo 4 Hidden Singles valore: 4.7 categoria doc: Getting_Started
5 in C4 is last in column
Passo 5 Naked Pair valore: 22.1 categoria doc: Naked_Candidates
Naked Pair 2/8 on cells {D7|D8} means
- 8 can be removed from D1
- 8 can be removed from D2
- 8 can be removed from F8
- 8 can be removed from F9
Last candidate 6 in D1 changed to solution
Passo 6 Hidden Singles valore: 4.2 categoria doc: Getting_Started
8 in F2 is last in row/box
Passo 7 Y-Wing valore: 161.8 categoria doc: Y_Wing_Strategy
Y-Wing pattern. Hinge: B4 (6/8), wings B7 C5, therefore
- 4 can be removed from B5
- 4 can be removed from C8
Passo 8 Rectangle Elimination valore: 100.4 categoria doc: Rectangle_Elimination
If +8[B8] then -8[H8] forcing +8[H5] which removes all 8s from Box 2, so B8 cannot be 8
Passo 9 X-Cycle valore: 299.2 categoria doc: X_Cycles
X-CYCLE Rule 3 (Discontinuous Alternating Nice Loop, length 8):
+8[B7]-8[B4]+8[G4]-8[H5]+8[H8]-8[D8]+8[D7]-8[B7]
- Contradiction: When B7 is set to 8 the chain implies it cannot be 8 - it can be removed
Last candidate 4 in B7 changed to solution
Passo 10 Pointing Pairs valore: 56.5 categoria doc: Intersection_Removal
Triple: between Box 3 and Row A:
- 8 can be removed from A5
Passo 11 XY-Chain valore: 243.2 categoria doc: XY_Chains
length=4, chain ends: B4 and G1
This proves 8 is the solution at one or possibly both ends of the chain
-8[B4]+6[B4]-6[C5]+4[C5]-4[C1]+7[C1]-7[G1]+8[G1]
- 8 can be removed from G4
Last candidate 6 in G4 changed to solution
Passo 12 Naked Singles valore: 1.7 categoria doc: Getting_Started
Last candidate 8 in B4 changed to solution
Passo 13 Naked Triple valore: 67.1 categoria doc: Naked_Candidates
Naked Triple 3/8/9 on cells {G8|G9|J7} means
- 8 can be removed from H8
- 8/9 can be removed from J8
- 8 can be removed from J9
Passo 14 Hidden Singles valore: 3.3 categoria doc: Getting_Started
8 in H5 is last in row
Passo 15 Naked Singles valore: 1.6 categoria doc: Getting_Started
Last candidate 2 in G5 changed to solution
Passo 16 Naked Singles valore: 1.5 categoria doc: Getting_Started
Last candidate 5 in J5 changed to solution
Passo 17 Hidden Singles valore: 3 categoria doc: Getting_Started
5 in A1 is last in column
Passo 18 XY-Chain valore: 306.2 categoria doc: XY_Chains
length=8, chain ends: A9 and G1
This proves 8 is the solution at one or possibly both ends of the chain
-8[A9]+6[A9]-6[J9]+1[J9]-1[F9]+7[F9]-7[F5]+9[F5]-9[D5]+3[D5]-3[D2]+9[D2]-9[G2]+7[G2]-7[G1]+8[G1]
- 8 can be removed from G9
Last candidate 3 in G9 changed to solution
Passo 19 Hidden Singles valore: 2.8 categoria doc: Getting_Started
8 in A9 is last in column
Passo 20 Hidden Pair valore: 25.9 categoria doc: Hidden_Candidates
Hidden Pair 2/3 in Row C, on cells {C2|C8}
- removes 4/6/7 from C2
- removes 6/7 from C8
Passo 21 XY-Chain valore: 262.9 categoria doc: XY_Chains
length=8, chain ends: H8 and J1
This proves 4 is the solution at one or possibly both ends of the chain
-4[H8]+6[H8]-6[J9]+1[J9]-1[F9]+7[F9]-7[C9]+6[C9]-6[C5]+4[C5]-4[C1]+7[C1]-7[G1]+8[G1]-8[J1]+4[J1]
- 4 can be removed from H2
- 4 can be removed from H3
- 4 can be removed from J8
Passo 22 Hidden Singles valore: 2.5 categoria doc: Getting_Started
4 in H8 is last in row/column/box
Passo 23 Naked Pair valore: 12 categoria doc: Naked_Candidates
Naked Pair 5/6 on cells {H2|H3} means
- 6 can be removed from J2
- 6 can be removed from J3
Passo 24 XY-Chain valore: 150.2 categoria doc: XY_Chains
length=4, chain ends: B3 and D2
This proves 3 is the solution at one or possibly both ends of the chain
-3[B3]+6[B3]-6[H3]+5[H3]-5[F3]+9[F3]-9[D2]+3[D2]
- 3 can be removed from B2
- 3 can be removed from C2
- 3 can be removed from E3
Last candidate 2 in C2 changed to solution
Passo 25 Naked Singles valore: 1.1 categoria doc: Getting_Started
Last candidate 3 in C8 changed to solution
Passo 26 Hidden Singles valore: 2 categoria doc: Getting_Started
2 in J3 is last in row/column/box
3 in B3 is last in row/column/box
Passo 27 Hidden Singles valore: 2 categoria doc: Getting_Started
9 in F3 is last in column
Passo 28 Naked Singles valore: 0.8 categoria doc: Getting_Started
Last candidate 3 in D2 changed to solution
Last candidate 7 in F5 changed to solution
Passo 29 Naked Singles valore: 0.8 categoria doc: Getting_Started
Last candidate 9 in D5 changed to solution
Last candidate 3 in E5 changed to solution
Last candidate 1 in F9 changed to solution
Passo 30 Naked Singles valore: 0.7 categoria doc: Getting_Started
Last candidate 5 in F8 changed to solution
Last candidate 6 in J9 changed to solution
Passo 31 Naked Singles valore: 0.6 categoria doc: Getting_Started
Last candidate 7 in C9 changed to solution
Last candidate 7 in E8 changed to solution
Last candidate 1 in J8 changed to solution
Passo 32 Naked Singles valore: 0.5 categoria doc: Getting_Started
Last candidate 6 in B8 changed to solution
Last candidate 4 in C1 changed to solution
Passo 33 Naked Singles valore: 0.4 categoria doc: Getting_Started
Last candidate 6 in A3 changed to solution
Last candidate 1 in B5 changed to solution
Last candidate 6 in C5 changed to solution
Last candidate 8 in J1 changed to solution
Passo 34 Naked Singles valore: 0.2 categoria doc: Getting_Started
Last candidate 1 in A2 changed to solution
Last candidate 4 in A5 changed to solution
Last candidate 7 in B2 changed to solution
Last candidate 7 in G1 changed to solution
Last candidate 5 in H3 changed to solution
Last candidate 9 in J7 changed to solution
Passo 35 Naked Singles valore: 0.1 categoria doc: Getting_Started
Last candidate 2 in A7 changed to solution
Last candidate 4 in E3 changed to solution
Last candidate 9 in G2 changed to solution
Last candidate 8 in G8 changed to solution
Last candidate 6 in H2 changed to solution
Last candidate 4 in J2 changed to solution
Passo 36 Naked Singles valore: 0 categoria doc: Getting_Started
Last candidate 9 in A8 changed to solution
Last candidate 8 in D7 changed to solution
Last candidate 2 in D8 changed to solution
Last candidate 5 in E2 changed to solution