5
9
2
7
8
5
4
1
3
6
8
5
1
9
8
7
2
4
7
2
1
9
3
2
7
9
5
7
9
9
1
6
7
5
6
9

לסודוקו זה יש 11 שלבי פתירה וכדי לפתור אותו יש להשתמש בטכניקות Locked Pair, Locked Candidates Type 1 (Pointing), Naked Single, Uniqueness Test 3, undefined, Continuous Nice Loop, Grouped Discontinuous Nice Loop, Give Up.

Naked Single הסבר
Locked Candidates הסבר
נסו לפתור

שלבי פתירה:

  1. Locked Pair: 2,6 in r12c5 => r12c4,r46c5<>6, r12c4,r89c5<>2
  2. Locked Candidates Type 1 (Pointing): 5 in b4 => r7c3<>5
  3. Locked Candidates Type 1 (Pointing): 8 in b6 => r6c5<>8
  4. שורה 6 / עמודה 5 ← 3 (Naked Single)
  5. Locked Candidates Type 1 (Pointing): 1 in b9 => r8c2<>1
  6. Uniqueness Test 3: 7/9 in r1c47,r2c47 => r8c7<>1, r8c7<>2, r8c7<>4, r8c7<>8
  7. שורה 8 / עמודה 7 ← 7 (Naked Single)
  8. XY-Chain: 4 4- r6c1 -6- r4c3 -5- r4c5 -8- r9c5 -4 => r9c1<>4
  9. Continuous Nice Loop: 3/4/5/6 5= r7c2 =6= r7c3 -6- r4c3 -5- r4c5 =5= r8c5 -5- r8c2 =5= r7c2 =6 => r7c2<>3, r7c2<>4, r48c4<>5, r125c3<>6
  10. Grouped Discontinuous Nice Loop: 8 r7c3 -8- r2c3 =8= r2c1 =6= r56c1 -6- r4c3 =6= r7c3 => r7c3<>8
  11. Give Up: Don't know how to proceed!
הצג עוד...