困難反騎士數獨
相距騎士步的儲存格不能有相同數字。這是一個影響每一行每一列的全局約束。
困難 反騎士數獨。稀疏的給定數字和長的跨單元騎士鏈使這成為一個要求高的解題——在開始推理之前初始化所有騎士刪除。
1
2
9
8
4
6
5
1
2
9
9
2
3
7
4
2
7
8
3
5
7
6
9
5
5
3
6
什麼是 反騎士數獨？
難度
★★★☆☆
3/5
約束類型
反限制
典型給定數
20–26
平均解題時間（困難）
24分鐘
解題技巧：困難 等級
| 技巧 | 描述 | 等級 |
|---|---|---|
| Knight-Zone Mapping | For each cell, mark all potential knight-move destinations (up to 8 cells). None may share the same digit as the source cell. | 初學者 |
| Corner and Edge Advantage | Corner cells have only 2 knight-move neighbours; edge cells have at most 4. These restricted zones are easiest to resolve first. | 初學者 |
| Knight Chains | Placing a digit can eliminate it from a chain of knight-move positions that span diagonally across the grid. | 中級 |
| Graph Coloring | Model the knight-move network as a graph and two-color it to find cells that cannot share a digit. | 進階 |
準備好終極測試了嗎？試試 專家 反騎士數獨 — 數獨 上最難的謎題。
在 困難 需要掌握的技巧
- Hidden Pairs technique — Hard Anti-Knight grids hide pairs in cells whose other candidates were removed by L-shaped eliminations two moves earlier — keep notes scrupulously current to see them.
- X-Wing 技巧 — The knight constraint often leaves a digit exactly two legal cells per row across distant boxes — prime X-Wing geometry that classic grids take far longer to produce.
依難度平均解題時間
簡單
5分鐘
中等
12分鐘
困難
24分鐘
專家
45分鐘
想要規則、策略和解題步驟的完整演練嗎？
如何遊玩 反騎士數獨 →
相關變體
反國王數獨
The shorter-range chess rule — repeats forbidden among all eight touching cells rather than across L-shaped leaps.
反連續數獨
Trades geometric reach for value logic: orthogonal neighbours may never hold consecutive digits.
非連續數獨
Same constraint family — a global unmarked rule whose eliminations cascade after every placement.
常見問題 — 困難 反騎士數獨
還有問題？請參閱完整 反騎士數獨指南.