困難 克隆數獨
陰影區域是克隆 — 數字內容和位置完全相同。一個填入會同時更新所有克隆。
困難 克隆數獨。較少的給定數字和複雜的克隆區域互動——預計多步驟雙向傳播和廣泛的 候選數 追蹤。
4
8
2
8
3
5
3
4
1
1
8
6
7
2
1
3
8
3
5
9
4
1
1
3
5
8
9
克隆A
克隆B
兩個區域必須有相同的數字
什麼是 克隆數獨？
難度
★★★★☆
4/5
約束類型
Clone Regions
典型給定數字
24–32
平均解題（困難）
42 分鐘
解謎技巧（困難 等級）
| 技巧 | 描述 | 等級 |
|---|---|---|
| Clone Pair Deduction | Any digit placed in one clone region immediately forces the same digit in the corresponding cell of the other clone region. | 初學者 |
| Constraint Propagation | A clone placement propagates through standard row, column, and box constraints in both regions simultaneously. | 中級 |
| Clone-Box Interaction | If both clone regions share boxes with heavily constrained cells, the clone constraint rapidly resolves entire boxes. | 中級 |
| Mirror Elimination | When a digit is eliminated from a position in one clone region by standard logic, it can be eliminated from the same position in the other clone region. | 進階 |
| Multi-Clone Logic | With two clone regions, solving either provides equal information about both. Alternate deduction paths between clones for maximum efficiency. | 進階 |
準備好終極測試了嗎？試試 專家 克隆數獨 — 數獨 上最難的謎題。
在 困難 需要掌握的技巧
- Hidden Pairs technique — Twin-imported eliminations thin cells invisibly — recount the boxes hosting each clone region after every mirror update, because that's where hard clone grids hide pairs.
- X翼技巧 — Eliminations exported through the clone link land in rows the original logic never touched — re-scan for X-Wings after each mirror transfer, not just after direct placements.
按難度劃分的平均解題時間
簡單
10 分鐘
中等
22 分鐘
困難
42 分鐘
專家
72 分鐘
想要規則、策略和解題步驟的完整解說？
如何遊玩 克隆數獨 →
相關變體
混沌構造
Structure-as-puzzle taken to the limit: instead of mirroring known regions, you deduce where the regions even are.
拼圖數獨
Region-shape reading without the mirroring — nine snaking regions replace the standard boxes.
對角線數獨
Like clone cells, diagonal cells link distant parts of the grid — placements echo far beyond their own box.
常見問題 — 困難 克隆數獨
更多問題？請參閱完整 克隆數獨指南.