Passi risolutivi (36)
Passo 1
Naked Singles
valore: 0
categoria doc: Getting_Started
Last candidate 3 in C6 changed to solution
Last candidate 9 in D4 changed to solution
Last candidate 9 in F1 changed to solution
Passo 2
Naked Singles
valore: 2.4
categoria doc: Getting_Started
Last candidate 5 in A4 changed to solution
Last candidate 4 in A6 changed to solution
Last candidate 3 in D5 changed to solution
Passo 3
Naked Singles
valore: 2.2
categoria doc: Getting_Started
Last candidate 8 in G4 changed to solution
Passo 4
Naked Singles
valore: 2.2
categoria doc: Getting_Started
Last candidate 7 in J4 changed to solution
Passo 5
Hidden Singles
valore: 4.1
categoria doc: Getting_Started
7 in D3 is last in row/box
Passo 6
Hidden Singles
valore: 3.9
categoria doc: Getting_Started
1 in F3 is last in column/box
7 in H2 is last in row/box
Passo 7
Hidden Singles
valore: 3.8
categoria doc: Getting_Started
8 in F5 is last in row
Passo 8
Naked Pair
valore: 18.3
categoria doc: Naked_Candidates
Naked Pair 1/4 on cells {D7|D9} means
- 4 can be removed from E7
- 4 can be removed from E9
Passo 9
XY-Chain
valore: 236
categoria doc: XY_Chains
length=4, chain ends: A1 and J6
This proves 6 is the solution at one or possibly both ends of the chain
-6[A1]+3[A1]-3[B2]+9[B2]-9[J2]+2[J2]-2[J6]+6[J6]
- 6 can be removed from J1
Last candidate 5 in J1 changed to solution
Passo 10
Naked Singles
valore: 1.7
categoria doc: Getting_Started
Last candidate 7 in C1 changed to solution
Passo 11
Naked Singles
valore: 1.7
categoria doc: Getting_Started
Last candidate 9 in C5 changed to solution
Passo 12
Naked Singles
valore: 1.6
categoria doc: Getting_Started
Last candidate 1 in A5 changed to solution
Last candidate 8 in C7 changed to solution
Passo 13
Naked Singles
valore: 1.5
categoria doc: Getting_Started
Last candidate 7 in B5 changed to solution
Last candidate 5 in C3 changed to solution
Passo 14
Hidden Singles
valore: 2.8
categoria doc: Getting_Started
8 in J9 is last in row/column/box
Passo 15
Hidden Singles
valore: 2.8
categoria doc: Getting_Started
1 in D9 is last in column
Passo 16
Naked Singles
valore: 1.4
categoria doc: Getting_Started
Last candidate 4 in D7 changed to solution
Passo 17
Hidden Singles
valore: 2.5
categoria doc: Getting_Started
4 in H9 is last in column/box
4 in J5 is last in row
Passo 18
Hidden Pair
valore: 23.4
categoria doc: Hidden_Candidates
Hidden Pair 2/8 in Box 1, on cells {A2|A3}
- removes 3/9 from A2
- removes 6/9 from A3
Passo 19
Pointing Pairs
valore: 34.7
categoria doc: Intersection_Removal
Pair: between Box 7 and Col 3:
- 6 can be removed from B3
Passo 20
Pointing Pairs
valore: 33.8
categoria doc: Intersection_Removal
Pair: between Box 1 and Row B:
- 9 can be removed from B7
- 9 can be removed from B8
Passo 21
XY-Chain
valore: 231.1
categoria doc: XY_Chains
length=8, chain ends: A8 and E9
This proves 9 is the solution at one or possibly both ends of the chain
-9[A8]+6[A8]-6[A1]+3[A1]-3[B2]+9[B2]-9[J2]+2[J2]-2[J6]+6[J6]-6[F6]+2[F6]-2[E5]+6[E5]-6[E9]+9[E9]
- 9 can be removed from A9
- 9 can be removed from E8
Passo 22
Hidden Singles
valore: 2.1
categoria doc: Getting_Started
9 in A8 is last in row/box
9 in E9 is last in column
Passo 23
XY-Chain
valore: 161.3
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
-3[A1]+6[A1]-6[A9]+3[A9]-3[G9]+6[G9]-6[G3]+2[G3]-2[J2]+9[J2]-9[B2]+3[B2]-3[A1]
- 6 can be removed from G5
- 6 can be removed from G7
- 2 can be removed from H3
- 3 can be removed from B1
Passo 24
Y-Wing
valore: 74.8
categoria doc: Y_Wing_Strategy
Y-Wing pattern. Hinge: J2 (2/9), wings H3 J6, therefore
- 6 can be removed from H5
Passo 25
Hidden Singles
valore: 1.8
categoria doc: Getting_Started
6 in E5 is last in column
6 in J6 is last in box
Passo 26
Naked Singles
valore: 0.8
categoria doc: Getting_Started
Last candidate 2 in F6 changed to solution
Passo 27
Naked Singles
valore: 0.8
categoria doc: Getting_Started
Last candidate 6 in F7 changed to solution
Passo 28
W-Wing
valore: 36.5
categoria doc: W_Wings
W-Wing (single). Either there is a 2 in E7 or in H5. They are connected through 5 in E8/H8, therefore
- 2 can be removed from H7
Passo 29
XY-Chain
valore: 91.2
categoria doc: XY_Chains
length=4, chain ends: B7 and J8
This proves 1 is the solution at one or possibly both ends of the chain
-1[B7]+3[B7]-3[B2]+9[B2]-9[J2]+2[J2]-2[J8]+1[J8]
- 1 can be removed from B8
- 1 can be removed from J7
Last candidate 6 in B8 changed to solution
Passo 30
Naked Singles
valore: 0.6
categoria doc: Getting_Started
Last candidate 3 in A9 changed to solution
Last candidate 4 in B1 changed to solution
Passo 31
Naked Singles
valore: 0.6
categoria doc: Getting_Started
Last candidate 6 in A1 changed to solution
Last candidate 9 in B3 changed to solution
Last candidate 1 in B7 changed to solution
Last candidate 3 in E1 changed to solution
Last candidate 6 in G9 changed to solution
Passo 32
Naked Singles
valore: 0.4
categoria doc: Getting_Started
Last candidate 3 in B2 changed to solution
Last candidate 8 in E2 changed to solution
Last candidate 2 in G3 changed to solution
Last candidate 6 in H3 changed to solution
Passo 33
Naked Singles
valore: 0.3
categoria doc: Getting_Started
Last candidate 2 in A2 changed to solution
Last candidate 8 in A3 changed to solution
Last candidate 4 in E3 changed to solution
Last candidate 5 in G5 changed to solution
Last candidate 9 in J2 changed to solution
Passo 34
Naked Singles
valore: 0.2
categoria doc: Getting_Started
Last candidate 3 in G7 changed to solution
Last candidate 2 in H5 changed to solution
Last candidate 2 in J7 changed to solution
Passo 35
Naked Singles
valore: 0.1
categoria doc: Getting_Started
Last candidate 5 in E7 changed to solution
Last candidate 5 in H8 changed to solution
Last candidate 1 in J8 changed to solution
Passo 36
Naked Singles
valore: 0
categoria doc: Getting_Started
Last candidate 2 in E8 changed to solution
Last candidate 9 in H7 changed to solution