Passi risolutivi (42)
Passo 1
Hidden Singles
valore: 5.4
categoria doc: Getting_Started
1 in A6 is last in row/box
1 in E9 is last in column/box
1 in H5 is last in column
2 in A7 is last in column/box
3 in B4 is last in row/column/box
4 in B8 is last in box
4 in C1 is last in row
9 in J7 is last in column
Passo 2
Hidden Singles
valore: 4.6
categoria doc: Getting_Started
7 in A4 is last in row/box
7 in F9 is last in column/box
9 in E8 is last in row/column/box
9 in H4 is last in row/box
Passo 3
Hidden Pair
valore: 41
categoria doc: Hidden_Candidates
Hidden Pair 3/4 in Box 7, on cells {G2|H2}
- removes 2/5/6/7 from G2
- removes 2/5/6 from H2
Passo 4
Naked Pair
valore: 20.2
categoria doc: Naked_Candidates
Naked Pair 3/4 on cells {G2|H2} means
- 3 can be removed from D2
- 3 can be removed from F2
Passo 5
Pointing Pairs
valore: 59.8
categoria doc: Intersection_Removal
Pair: between Box 7 and Col 1:
- 2 can be removed from B1
- 2 can be removed from E1
Passo 6
Pointing Pairs
valore: 59.4
categoria doc: Intersection_Removal
Pair: between Box 6 and Col 8:
- 3 can be removed from H8
Passo 7
Pointing Pairs
valore: 59
categoria doc: Intersection_Removal
Pair: between Box 5 and Col 5:
- 7 can be removed from G5
Passo 8
Pointing Pairs
valore: 57.8
categoria doc: Intersection_Removal
Pair: between Box 1 and Row B:
- 8 can be removed from B5
- 8 can be removed from B6
- 8 can be removed from B9
Passo 9
Pointing Pairs
valore: 57.4
categoria doc: Intersection_Removal
Pair: between Box 2 and Row C:
- 8 can be removed from C9
Passo 10
Pointing Pairs
valore: 56.1
categoria doc: Intersection_Removal
Pair: between Box 9 and Row G:
- 8 can be removed from G4
- 8 can be removed from G5
- 8 can be removed from G6
Passo 11
Rectangle Elimination
valore: 92.8
categoria doc: Rectangle_Elimination
If +2[C5] then -2[C3] forcing +2[F3] which removes all 2s from Box 5, so C5 cannot be 2
Passo 12
X-Cycle
valore: 276.5
categoria doc: X_Cycles
X-CYCLE on 2 (Discontinuous Alternating Nice Loop, length 8):
+2[G5]-2[G4]+2[C4]-2[C3]+2[B2]-2[E2]+2[E5]-2[G5]
- Contradiction: When G5 is set to 2 the chain implies it cannot be 2 - it can be removed
Passo 13
XY-Chain
valore: 237.8
categoria doc: XY_Chains
length=4, chain ends: A3 and J4
This proves 5 is the solution at one or possibly both ends of the chain
-5[A3]+6[A3]-6[C3]+2[C3]-2[C4]+8[C4]-8[J4]+5[J4]
- 5 can be removed from J3
Passo 14
XY-Chain
valore: 228.9
categoria doc: XY_Chains
length=4, chain ends: B6 and G5
This proves 6 is the solution at one or possibly both ends of the chain
-6[B6]+2[B6]-2[C4]+8[C4]-8[J4]+5[J4]-5[G5]+6[G5]
- 6 can be removed from B5
- 6 can be removed from C5
- 6 can be removed from G6
- 6 can be removed from H6
- 6 can be removed from J6
Passo 15
Hidden Singles
valore: 3.5
categoria doc: Getting_Started
6 in B6 is last in column/box
6 in G5 is last in column/box
Passo 16
Naked Singles
valore: 1.6
categoria doc: Getting_Started
Last candidate 8 in G7 changed to solution
Passo 17
Hidden Singles
valore: 3.1
categoria doc: Getting_Started
8 in A9 is last in column
Passo 18
Naked Pair
valore: 14.9
categoria doc: Naked_Candidates
Naked Pair 5/6 on cells {A8|H8} means
- 6 can be removed from D8
- 6 can be removed from F8
Passo 19
Pointing Pairs
valore: 44.2
categoria doc: Intersection_Removal
Pair: between Box 8 and Col 4:
- 5 can be removed from D4
Passo 20
Pointing Pairs
valore: 42.9
categoria doc: Intersection_Removal
Pair: between Box 1 and Col 3:
- 6 can be removed from D3
- 6 can be removed from F3
- 6 can be removed from J3
Last candidate 1 in J3 changed to solution
Passo 21
Hidden Singles
valore: 2.7
categoria doc: Getting_Started
1 in D1 is last in row/column/box
Passo 22
Pointing Pairs
valore: 39.2
categoria doc: Intersection_Removal
Pair: between Box 4 and Col 2:
- 6 can be removed from J2
Passo 23
Hidden Singles
valore: 2.6
categoria doc: Getting_Started
6 in J1 is last in row
Passo 24
X-Wing
valore: 73.5
categoria doc: X_Wing_Strategy
(Col->Row) 2 taken off F2, based on BE25
(Col->Row) 2 taken off F5, based on BE25
Passo 25
XY-Chain
valore: 181.6
categoria doc: XY_Chains
length=5, chain ends: D8 and C4
This proves 8 is the solution at one or possibly both ends of the chain
-8[D8]+3[D8]-3[D3]+5[D3]-5[A3]+6[A3]-6[C3]+2[C3]-2[C4]+8[C4]
- 8 can be removed from D4
Last candidate 4 in D4 changed to solution
Passo 26
Naked Singles
valore: 1.1
categoria doc: Getting_Started
Last candidate 6 in D7 changed to solution
Passo 27
Naked Singles
valore: 1.1
categoria doc: Getting_Started
Last candidate 4 in F7 changed to solution
Passo 28
Hidden Singles
valore: 2.1
categoria doc: Getting_Started
6 in F2 is last in row/column/box
Passo 29
Chute Remote Pair
valore: 51.6
categoria doc: Chute_Remote_Pairs
5 cannot be set in the yellow cells {J7,J8,J9} and with the Remote Pair in G4 and H1 it means:
- 2 can be removed from G1
- 2 can be removed from H6
Last candidate 4 in H6 changed to solution
Passo 30
Naked Singles
valore: 0.9
categoria doc: Getting_Started
Last candidate 3 in H2 changed to solution
Passo 31
Naked Singles
valore: 0.9
categoria doc: Getting_Started
Last candidate 4 in G2 changed to solution
Passo 32
Hidden Singles
valore: 1.8
categoria doc: Getting_Started
2 in H1 is last in row/column/box
3 in G9 is last in row/column/box
Passo 33
XYZ Wing
valore: 104
categoria doc: XYZ_Wing
XYZ-Wing pattern. Hinge: D2 (5/7/8), wings E1 J2, therefore
- 7 can be removed from E2
Passo 34
XY-Chain
valore: 145
categoria doc: XY_Chains
length=6, chain ends: B5 and G4
This proves 2 is the solution at one or possibly both ends of the chain
-2[B5]+9[B5]-9[B9]+5[B9]-5[B1]+8[B1]-8[E1]+7[E1]-7[G1]+7[G6]-2[G6]+2[G4]
- 2 can be removed from C4
Last candidate 8 in C4 changed to solution
Passo 35
Naked Singles
valore: 0.7
categoria doc: Getting_Started
Last candidate 9 in C5 changed to solution
Last candidate 5 in J4 changed to solution
Passo 36
Naked Singles
valore: 0.6
categoria doc: Getting_Started
Last candidate 2 in B5 changed to solution
Last candidate 6 in C9 changed to solution
Last candidate 2 in G4 changed to solution
Last candidate 7 in J2 changed to solution
Passo 37
Naked Singles
valore: 0.4
categoria doc: Getting_Started
Last candidate 5 in A8 changed to solution
Last candidate 2 in C3 changed to solution
Last candidate 5 in G1 changed to solution
Last candidate 7 in G6 changed to solution
Last candidate 5 in H9 changed to solution
Last candidate 8 in J6 changed to solution
Passo 38
Naked Singles
valore: 0.3
categoria doc: Getting_Started
Last candidate 6 in A3 changed to solution
Last candidate 8 in B1 changed to solution
Last candidate 9 in B9 changed to solution
Last candidate 2 in F6 changed to solution
Last candidate 6 in H8 changed to solution
Passo 39
Naked Singles
valore: 0.2
categoria doc: Getting_Started
Last candidate 5 in B2 changed to solution
Last candidate 7 in E1 changed to solution
Passo 40
Naked Singles
valore: 0.2
categoria doc: Getting_Started
Last candidate 8 in D2 changed to solution
Last candidate 8 in E5 changed to solution
Passo 41
Naked Singles
valore: 0.1
categoria doc: Getting_Started
Last candidate 3 in D8 changed to solution
Last candidate 2 in E2 changed to solution
Last candidate 5 in F5 changed to solution
Passo 42
Naked Singles
valore: 0
categoria doc: Getting_Started
Last candidate 5 in D3 changed to solution
Last candidate 7 in D5 changed to solution
Last candidate 3 in F3 changed to solution
Last candidate 8 in F8 changed to solution