FortresS-Cells
(Eingestellt am 23. Juli 2026, 22:20 Uhr von Scojo)
Rules:
- Place the digits 0-9 once each in every row, column, and 3x3 box. To achieve this, one cell in each row, column, and box must contain two digits.
- Schrödinger's Fortress: For any cell in the grid that contains two digits, one of the digits must be greater than all of the digits in orthogonally adjacent cells, and the other digit must be lower than all of the digits in orthogonally adjacent cells.
- Cages: Digits in a cage sum to the total in the top left corner of the cage.
Solve in SudokuPad

Lösungscode: The 10 digits in row 7 from left to right, with the lower digit first for the cell with two digits.
Gelöst von ChinStrap, gdc, lmdemasi, Ratfinkz, palpot, Wuschel, beansontoast_, mathhead, amirs, OlafLemme, SKORP17, jmw, asynchronous, sehringdipity, Gunkan, karlmortenlunna, bansalsaab, dorverbin, aqjhs, Arheus, marcmees, abed hawila, SennyK, bianbianPEI, reformist, widjo, ATBlanchard, HonkIfYouLoveBeer, Lizzy01, Wahaj
Kommentare
am 29. Juli 2026, 11:43 Uhr von SennyK
What a wonderful construction :-)
am 27. Juli 2026, 17:36 Uhr von Arheus
This is lovely! This must make it to CTC just to watch Simon's head wrap around the concept and implications :D
am 25. Juli 2026, 11:25 Uhr von Gunkan
Agree, absolutely lovely
am 24. Juli 2026, 12:36 Uhr von amirs
Quite tricky but absolutely lovely!