Passi risolutivi (15)
Passo 1
Naked Singles
valore: 2
categoria doc: Getting_Started
Last candidate 8 in A6 changed to solution
Last candidate 8 in E9 changed to solution
Last candidate 7 in C9 changed to solution
Last candidate 6 in E7 changed to solution
Passo 2
Naked Singles
valore: 2.2
categoria doc: Getting_Started
Last candidate 4 in B9 changed to solution
Last candidate 2 in J9 changed to solution
Last candidate 1 in H9 changed to solution
Passo 3
Hidden Singles
valore: 3.8
categoria doc: Getting_Started
1 in B2 is last in row
2 in F7 is last in column/box
2 in G4 is last in column/box
6 in A2 is last in row
6 in C8 is last in column/box
6 in D6 is last in column
6 in H5 is last in row/box
7 in D3 is last in box
8 in F5 is last in row/column/box
Passo 4
Naked Singles
valore: 1.4
categoria doc: Getting_Started
Last candidate 5 in D5 changed to solution
Last candidate 2 in D2 changed to solution
Last candidate 1 in D4 changed to solution
Passo 5
Hidden Singles
valore: 2.5
categoria doc: Getting_Started
1 in C6 is last in row/column/box
5 in C7 is last in box
5 in J4 is last in column/box
7 in G7 is last in row/column/box
Passo 6
Naked Pair
valore: 10.9
categoria doc: Naked_Candidates
Naked Pair 3/8 on cells {B7|B8} means
- 3 can be removed from B1
- 3/8 can be removed from B3
- 3 can be removed from B5
Passo 7
Pointing Pairs
valore: 32.2
categoria doc: Intersection_Removal
Pair: between Box 7 and Row G:
- 8 can be removed from G8
Passo 8
Line/Unit Reduction
valore: 40.7
categoria doc: Intersection_Removal
Line/Box Reduction: 5s in box 7 remove the following in the same box:
- 5 can be removed from G1
- 5 can be removed from G3
- 5 can be removed from H1
- 5 can be removed from H3
Passo 9
Rectangle Elimination
valore: 50.2
categoria doc: Rectangle_Elimination
If +4[G3] then -4[E3] forcing +4[E5] which removes all 4s from box 8, so G3 cannot be 4
Passo 10
Simple Colouring
valore: 99
categoria doc: Singles_Chains
(RULE 4): Uncoloured candidate 9 in H3 can see two different coloured candidates of 9 elsewhere.
Passo 11
XY-Chain
valore: 146.5
categoria doc: XY_Chains
length=5, chain ends: G1 and A5
This proves 3 is the solution at one or possibly both ends of the chain
-3[G1]+9[G1]-9[G6]+4[G6]-4[J5]+9[J5]-9[B5]+7[B5]-7[A5]+3[A5]
- 3 can be removed from A1
Passo 12
Y-Wing
valore: 77
categoria doc: Y_Wing_Strategy
Y-Wing pattern. Hinge: A1 (5/7), wings A5 E1, therefore
- 3 can be removed from E5
Last candidate 4 in E5 changed to solution
Last candidate 9 in F6 changed to solution
Last candidate 4 in G6 changed to solution
Last candidate 9 in J5 changed to solution
Last candidate 8 in J7 changed to solution
Last candidate 4 in J8 changed to solution
Passo 13
Naked Singles
valore: 0.6
categoria doc: Getting_Started
Last candidate 7 in B5 changed to solution
Last candidate 3 in B7 changed to solution
Last candidate 8 in B8 changed to solution
Last candidate 3 in F4 changed to solution
Last candidate 9 in H7 changed to solution
Last candidate 3 in A5 changed to solution
Last candidate 9 in C4 changed to solution
Last candidate 4 in F2 changed to solution
Passo 14
Naked Singles
valore: 0.4
categoria doc: Getting_Started
Last candidate 5 in A3 changed to solution
Last candidate 3 in E3 changed to solution
Last candidate 7 in A1 changed to solution
Last candidate 8 in C3 changed to solution
Last candidate 5 in E1 changed to solution
Last candidate 9 in G3 changed to solution
Passo 15
Naked Singles
valore: 0
categoria doc: Getting_Started
Last candidate 2 in B3 changed to solution
Last candidate 3 in C2 changed to solution
Last candidate 3 in G1 changed to solution
Last candidate 5 in G8 changed to solution
Last candidate 2 in H1 changed to solution
Last candidate 5 in H2 changed to solution
Last candidate 4 in H3 changed to solution
Last candidate 3 in H8 changed to solution
Last candidate 9 in B1 changed to solution
Last candidate 8 in G2 changed to solution