🧩 Sudoku Solve Path Explorer

← Torna all'elenco

PDF :::: Sudoku Solve Path

File jsonD:\inetpub\webs\ruggeriinfo\public\sudoku\json\L4_25_05_2026_2026_05_27_14_44_44534159.json
File pdfD:/inetpub/webs/ruggeriinfo/public/sudoku/pdf/L4_25_05_2026_2026_05_27_14_44_44534159_8_6.pdf

← Torna all'elenco

Sudoku Solve Path

Gradodisallowed as strategies excluded Livello5 (precedente: 5)
Punteggio finale8.6 Punteggio precedente193
Indizi25 # Passi22
Versione generatoreversion 4.01, 26-May-2026
Soluzione917648235456273981832519674548132769761985423293467158624851397389724516175396842
FileD:\inetpub\webs\ruggeriinfo\public\sudoku\json\L4_25_05_2026_2026_05_27_14_44_44534159.json

Passi risolutivi (22)

Passo 1 Naked Singles valore: 0 categoria doc: Getting_Started
Last candidate 7 in E1 changed to solution
Passo 2 Hidden Singles valore: 5.5 categoria doc: Getting_Started
3 in F3 is last in column/box
3 in J4 is last in row/box
9 in A1 is last in column
9 in H3 is last in row/box
Passo 3 Hidden Singles valore: 4.6 categoria doc: Getting_Started
1 in A2 is last in box
1 in J1 is last in column
3 in A8 is last in column
4 in D2 is last in box
6 in J6 is last in row/box
9 in B7 is last in row
9 in C6 is last in column/box
Passo 4 Hidden Singles valore: 3.8 categoria doc: Getting_Started
1 in H8 is last in column/box
9 in D9 is last in row/column/box
Passo 5 Hidden Singles valore: 3.5 categoria doc: Getting_Started
3 in D5 is last in row
3 in E9 is last in column/box
4 in H6 is last in row
Passo 6 Hidden Singles valore: 3 categoria doc: Getting_Started
4 in F4 is last in row/column/box
4 in G3 is last in row
Passo 7 Hidden Singles valore: 2.9 categoria doc: Getting_Started
6 in F5 is last in row/box
Passo 8 Pointing Pairs valore: 41.3 categoria doc: Intersection_Removal
Pair: between Box 3 and Row A:
- 2 can be removed from A4
- 2 can be removed from A6
Passo 9 Pointing Pairs valore: 40.9 categoria doc: Intersection_Removal
Pair: between Box 5 and Col 6:
- 7 can be removed from A6
Last candidate 8 in A6 changed to solution
Passo 10 Hidden Singles valore: 2.4 categoria doc: Getting_Started
8 in B8 is last in row/box
8 in G4 is last in column/box
Passo 11 Hidden Singles valore: 2.3 categoria doc: Getting_Started
8 in F9 is last in row/box
Passo 12 Pointing Pairs valore: 32.2 categoria doc: Intersection_Removal
Pair: between Box 8 and Col 5:
- 5 can be removed from B5
- 5 can be removed from C5
Passo 13 Y-Wing valore: 84.7 categoria doc: Y_Wing_Strategy
Y-Wing pattern. Hinge: B2 (5/7), wings B5 G2, therefore
- 2 can be removed from G5
Passo 14 Y-Wing valore: 83.6 categoria doc: Y_Wing_Strategy
Y-Wing pattern. Hinge: B5 (2/7), wings B2 H5, therefore
- 5 can be removed from H2
Passo 15 XY-Chain valore: 173 categoria doc: XY_Chains
length=6. This XY-Chain is continuous and one value in each cell must be the solution, so all off-chain candidates can be removed
-5[B2]+7[B2]-7[B5]+2[B5]-2[H5]+5[H5]-5[G5]+1[G5]-1[G6]+2[G6]-2[G2]+5[G2]-5[B2]
- 7 can be removed from B3
- 5 can be removed from J2
Passo 16 3D Medusa valore: 160.7 categoria doc: 3D_Medusa
(RULE 5): Uncoloured candidate 5 in A7 can see coloured 5 elsewhere and an oppositely coloured 7 in its own cell. It can be removed.
Passo 17 Unique Rectangle 2+ valore: 99 categoria doc: Unique_Rectangles
Uniqueness Type 5: removing 5 from B3 because if true it would create a Deadly Rectangle with A3 and B3
Last candidate 6 in B3 changed to solution
Passo 18 Unique Rectangle 2+ valore: 92.2 categoria doc: Unique_Rectangles
Uniqueness Type 5: removing 5 from C9 and J8 because if true it would create a Deadly Rectangle with C8 and J8
Last candidate 4 in C9 changed to solution Last candidate 4 in J8 changed to solution
Passo 19 X-Wing valore: 50.3 categoria doc: X_Wing_Strategy
(Row->Col) 5 taken off A4, based on AJ39
(Row->Col) 5 taken off J7, based on AJ39
Last candidate 6 in A4 changed to solution
Passo 20 Hidden Singles valore: 1.5 categoria doc: Getting_Started
6 in C7 is last in row/column/box
Passo 21 XY-Chain valore: 96.6 categoria doc: XY_Chains
length=4, chain ends: C4 and F8
This proves 5 is the solution at one or possibly both ends of the chain
-5[C4]+1[C4]-1[D4]+2[D4]-2[D1]+5[D1]-5[D7]+5[F8]
- 5 can be removed from C8
Last candidate 7 in C8 changed to solution Last candidate 5 in F8 changed to solution
Passo 22 Naked Singles valore: 0.3 categoria doc: Getting_Started
Last candidate 2 in A7 changed to solution Last candidate 5 in A9 changed to solution Last candidate 1 in C5 changed to solution Last candidate 7 in D7 changed to solution Last candidate 2 in F1 changed to solution Last candidate 7 in F6 changed to solution Last candidate 5 in G5 changed to solution Last candidate 2 in H5 changed to solution Last candidate 8 in J7 changed to solution Last candidate 2 in J9 changed to solution Last candidate 7 in A3 changed to solution Last candidate 5 in B2 changed to solution Last candidate 2 in B4 changed to solution Last candidate 7 in B5 changed to solution Last candidate 5 in C4 changed to solution Last candidate 5 in D1 changed to solution Last candidate 1 in D4 changed to solution Last candidate 2 in D6 changed to solution Last candidate 2 in G2 changed to solution Last candidate 1 in G6 changed to solution Last candidate 8 in H2 changed to solution Last candidate 5 in H7 changed to solution Last candidate 7 in J2 changed to solution Last candidate 5 in J3 changed to solution