专家 大于数独
单元格之间的不等号显示哪个更大。没有已知数字——所有放置仅从符号推断。
专家 大于数独。这是网站上最难的谜题——需要不等式强制链和奇偶锁定。无需猜测，没有已知数字。
9
5
2
8
7
2
8
6
2
1
4
8
1
2
6
3
4
9
2
5
1
8
7
7
6
什么是大于 / 小于数独？
难度
★★★☆☆
3/5
约束类型
单元格关系
典型给定数
18–24
平均解题 (专家)
58 分钟
专家 级别的解题技巧
| 技巧 | 描述 | 级别 |
|---|---|---|
| Chain Inequality — Minimums | Link inequalities in a chain: if A > B > C, then A ≥ 3, B ≥ 2, C ≥ 1. Use these minimums to prune candidates immediately. | 初级 |
| Chain Inequality — Maximums | In the chain A > B > C > D, also bound from above: A ≤ 9, B ≤ 8, C ≤ 7, D ≤ 6. | 初级 |
| Inequality Propagation | After placing a digit, check all inequality arrows from that cell and eliminate impossible values from its neighbours. | 中级 |
| Forced Single via Range | When an inequality chain reduces a cell's valid range to a single digit, place it directly. | 中级 |
在专家需要掌握的技巧
- X翼技巧 — Expert grids interleave chains so no cell bounds to a single digit — fish on 1 and 9 first, since the inequality lattice constrains the extremes most brutally.
- Swordfish technique — Long inequality chains confine middle digits to matching columns row after row; expert greater-than endgames are usually broken by a Swordfish on 4, 5, or 6.
按难度划分的平均解题时间
简单
7 分钟
中等
16 分钟
困难
32 分钟
专家
58 分钟
想要规则、策略和解题步骤的完整指南吗？
如何玩大于 / 小于数独 →
相关变体
黑白点数独
Refines your adjacent-cell reasoning with exact relationships — difference of 1 and ratio of 2 instead of plain order.
XV数独
Adjacent pairs constrained by sums rather than order, with a negative constraint on every unmarked edge.
奇数 / 偶数数独
Another value-property variant: parity shading halves candidates the way your inequality chains bound them.
常见问题 — 专家 大于数独
更多问题？请参阅完整 大于数独指南.