專家 反連續數獨
相鄰的格子 — 水平或垂直 — 不能包含連續的數字。為每次放置增加一個隱藏限制。
專家 反連續數獨。網站上最難的謎題——需要通過連續約束的強迫鏈。每個放置都可以邏輯證明。
3
9
7
4
2
3
7
5
2
8
5
2
6
2
6
8
5
9
3
3
5
4
2
什麼是 反連續數獨？
難度
★★★☆☆
3/5
約束類型
反限制
典型給定數字
18–24
平均解題（專家）
48 分鐘
解謎技巧（專家 等級）
| 技巧 | 描述 | 等級 |
|---|---|---|
| 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. | 進階 |
在 專家 需要掌握的技巧
- X翼技巧 — At expert level every placement triggers a board-wide ripple — fish patterns assemble and dissolve as the cascade runs, so re-scan for X-Wings after each ripple completes.
- Swordfish technique — Digit 5, hemmed in by both 4 and 6 everywhere, has the sparsest candidate map on the grid — the expert endgame Swordfish almost always swims on 5.
按難度劃分的平均解題時間
簡單
5 分鐘
中等
13 分鐘
困難
26 分鐘
專家
48 分鐘
想要規則、策略和解題步驟的完整解說？
如何遊玩 反連續數獨 →
相關變體
非連續數獨
The same neighbour rule under its other common name — more puzzles for exactly the logic you've practised here.
反國王數獨
Extends the anti-adjacency idea diagonally: no digit may repeat within a king's move of itself.
反騎士數獨
Stretches the forbidden relationship to L-shaped knight moves that leap across box borders.
常見問題 — 專家 反連續數獨
更多問題？請參閱完整 反連續數獨指南.