Anti-Ridder Sudoku

4
6
3
9
5
8
5
9
1
4
6
3
6
7
1
3
9
1
4
7
6
6
4
7
2
3
7
2
2
8
6
7
3
9
4
6
3
1
Fejl
0/3
Point
-
Tid
00:00
Nyt spil
Fremskridt0%
Let · Anti-Knight Sudoku Skift sværhedsgrad ovenfor ↑
Sådan spiller du Anti-Knight Sudoku
Standard Sudoku-regler gælder. Ekstra regel: ingen to celler, der kan nås med et skakspring (2+1 felter i en L-form), må indeholde samme ciffer. Begrænsningen er usynlig — ingen markører på brættet — så husk det, mens du løser.
Fuld guide →

Ingen to celler med et ridder-træk imellem må indeholde det samme ciffer

Hvad er Anti-Ridder Sudoku?

Anti-Knight Sudoku udvider Sudoku med en skakregel: enhver to celler, der kan nå hinanden med et skak springers træk (2+1 felter i en L-form), må ikke dele det samme ciffer. Hver celle har op til 8 potentielle springertræk-naboer. Dette skaber et rigt begrænsningsnetværk, der er adskilt fra og strækker sig ud over de standard række-/kolonne-/boksregler.

På et Blik

BegrænsningstypeAnti-Begrænsninger
Typiske givne tal20–26
Sværhedsgradsvurdering ★★★☆☆ 3/5
Gns. løsningstid — Let5 min
Gns. løsningstid — Mellem12 min
Gns. løsningstid — Svær24 min
Gns. løsningstid — Ekspert45 min

Sådan løser du Anti-Ridder Sudoku

TeknikHvad det gørNiveau
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. Avanceret
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. Avanceret
Knight Chains Placing a digit can eliminate it from a chain of knight-move positions that span diagonally across the grid. Avanceret
Graph Coloring Model the knight-move network as a graph and two-color it to find cells that cannot share a digit. Avanceret

Gennemsnitlige Løsningstider

Let
5 min
Mellem
12 min
Svær
24 min
Ekspert
45 min

Ofte stillede spørgsmål

Hvad er Anti-Knight Sudoku?
Anti-Knight Sudoku is a variant where no two cells that are a chess knight's move apart may contain the same digit. A knight moves in an L-shape: two cells in one direction and one cell perpendicular. This adds a non-adjacent constraint that reaches across boxes and rows in ways standard Sudoku cannot.
How far does the anti-knight constraint reach?
A knight's move covers up to eight possible cells: two squares in any cardinal direction plus one square perpendicular. These eight cells can span across different rows, columns, and boxes — so the anti-knight constraint connects parts of the grid that standard Sudoku treats as independent.
Is Anti-Knight Sudoku harder than regular Sudoku?
Yes. The knight-move relationships are less intuitive than row/column/box constraints and require deliberate mapping. Easy puzzles are accessible once you visualise the knight's reach. Hard and expert puzzles use the constraint to create deductions that would be impossible without it.
What is the hardest part of Anti-Knight Sudoku?
Remembering that the constraint spans across boxes. It is easy to forget that placing a 5 in the top-left corner eliminates 5 from cells that are in a completely different box. Systematically checking all eight knight-reach cells after every placement is essential.
Can standard Sudoku techniques still be used?
Yes — all standard techniques apply, with the knight-move relationships treated as additional elimination links. Naked pairs and hidden singles can be found by treating any two knight-move-related cells as a pair subject to uniqueness.
How long does Anti-Knight Sudoku take to solve?
Easy puzzles take 8–18 minutes. Medium puzzles run 18–35 minutes. Hard puzzles average 35–65 minutes and expert puzzles often exceed 90 minutes. The key to faster solving is visualising the full knight-reach pattern automatically after each placement.
Prøv også
Anti-Konge Sudoku
The shorter-range chess rule — repeats forbidden among all eight touching cells rather than across L-shaped leaps.
Anti-Konsekutiv Sudoku
Trades geometric reach for value logic: orthogonal neighbours may never hold consecutive digits.
Non-Consecutive Sudoku
Same constraint family — a global unmarked rule whose eliminations cascade after every placement.
Daglig udfordring