The Greatest Loop
(Eingestellt am 26. August 2026, 22:00 Uhr von ThePedallingPianist)
Normal sudoku rules apply.
Draw a loop that moves orthogonally between the centres of some cells and does not visit any cell more than once.
For any cell in which the loop turns, the digit on that loop corner is strictly greater than the sum of the adjacent digits on the loop.
Cells with a circle are not visited by the loop, and contain a digit showing how many of the (up to 8) surrounding cells are visited by the loop.
Lösungscode: Row 1 (top), left to right
Kommentare
am 29. August 2026, 11:23 Uhr von bboom
This becomes a lot easier once you decide to read properly and realize "greater than adjacent digits" isn't the same as "greater than the sum of adjacent digits". Fun one!
am 28. August 2026, 21:22 Uhr von emoney1374
Cool twist that’s well executed!
am 28. August 2026, 15:13 Uhr von ViKingPrime
I think you're becoming addicted to 6x6s, which is no bad thing.
am 27. August 2026, 11:58 Uhr von amirs
Very nice idea and implementation. It becomes relatively easy once you understand how powerful the constraint is.
am 26. August 2026, 23:45 Uhr von Astraeus
Beautiful! I love how such a seemingly little constraint can have such important implications throughout the grid.
