專家 反騎士數獨
相距騎士移動的單元格不能共享相同的數字。一個塑造每一行和每一列的全局約束。
專家 反騎士數獨。網站上最難的騎士移動謎題——需要跨越整個棋盤的強迫鏈。無需猜測。
1
9
3
4
8
8
1
6
8
3
9
3
1
6
8
4
2
8
4
1
7
2
4
3
5
2
什麼是 反騎士數獨？
難度
★★★☆☆
3/5
約束類型
反限制
典型給定數字
20–26
平均解題（專家）
45 分鐘
解謎技巧（專家 等級）
| 技巧 | 描述 | 等級 |
|---|---|---|
| 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. | 進階 |
在 專家 需要掌握的技巧
- X翼技巧 — Expert Anti-Knight endgames interleave fish eliminations with knight-reach eliminations; alternate the two systematically or the grid stalls.
- Swordfish technique — With knight moves pruning candidates across box borders, three-row Swordfish patterns form on digits that look untouched by row logic — enumerate 9 and 1 first.
按難度劃分的平均解題時間
簡單
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.
常見問題 — 專家 反騎士數獨
更多問題？請參閱完整 反騎士數獨指南.