困難 非連續數獨
相鄰的兩個儲存格不能包含連續數字。這個全域限制在棋盤上產生連鎖效應，大幅減少候選數。免費在線。
困難 非連續數獨。較少的給定數字和複雜的連續排除鏈——持續的 候選數 工作和雙向消除需要。
6
1
8
8
9
3
7
4
2
5
9
1
3
2
4
8
8
9
2
5
7
6
9
1
5
4
6
什麼是 非連續數獨？
難度
★★★☆☆
3/5
約束類型
反限制
典型給定數字
18–24
平均解題（困難）
26 分鐘
解謎技巧（困難 等級）
| 技巧 | 描述 | 等級 |
|---|---|---|
| Global Candidate Pruning | For every filled cell, remove its ±1 neighbours from all orthogonally adjacent cells immediately. | 初學者 |
| Digit 5 is Most Constrained | 5 cannot be adjacent to 4 or 6. Use this to restrict placement of 5 across the entire grid. | 中級 |
| Chain Propagation | Placing a digit propagates constraints along rows and columns, often triggering a cascade of forced placements. | 中級 |
| Forbidden Pair Maps | Build a map of forbidden digit pairs for each adjacent pair of cells and use it to eliminate candidates systematically. | 進階 |
準備好終極測試了嗎？試試 專家 非連續數獨 — 數獨 上最難的謎題。
在 困難 需要掌握的技巧
- Hidden Pairs technique — The ±1 eliminations quietly strip candidates until two digits share just two cells of a unit — recount after every cascade, because hard grids bury their pairs under neighbour logic.
- X翼技巧 — With so few givens, hard non-consecutive grids rely on fish: the global constraint pre-thins candidates so X-Wing rectangles form earlier than the sparse grid suggests.
按難度劃分的平均解題時間
簡單
5 分鐘
中等
13 分鐘
困難
26 分鐘
專家
48 分鐘
想要規則、策略和解題步驟的完整解說？
如何遊玩 非連續數獨 →
相關變體
連續數獨
The marked counterpart of your global rule — bars show exactly where consecutive neighbours sit, and absence means what you're used to.
反連續數獨
The same global neighbour restriction under its other name — an alternative puzzle pool built on identical logic.
反騎士數獨
Another unmarked anti-rule, pushing the forbidden relationship from orthogonal neighbours out to knight-move cells.
常見問題 — 困難 非連續數獨
更多問題？請參閱完整 非連續數獨指南.