Roman Modular Loop
(Eingestellt Gestern, 01:00 Uhr von yttrio)
Rules:
Normal Sudoku rules apply.
Draw a one-cell-wide loop of orthogonally connected cells. The loop may not touch itself, not even diagonally.
The loop acts as a modular line. Each set of three adjacent digits along the loop must be one each from the sets [147], [258], and [369].
XV: Digits separated by an X must sum to 10. Digits separated by a V must sum to 5. Not all possible Xs and Vs are necessarily given.
For each X and V, at least one of the digits touching the X or V must be on the loop.
The given greater-than sign points towards the lower of two neighboring digits.
Lösungscode: Digits on the loop in row 7 (left to right) followed by digits on the loop in column 7 (top to bottom)
Kommentare
Gestern, 23:26 Uhr von prodigis
Yet another brilliant loop creation!
Gestern, 23:21 Uhr von Christounet
Nice! Thanks :)
Gestern, 15:07 Uhr von Franjo
Amazing! Thank you very much for creating and sharing another one of your beautiful loop puzzles. I love all of them. Maybe it’s time to put some of these together for another puzzle hunt?
Gestern, 09:37 Uhr von salsais
After some thinking in the beginning the puzzle flowed cleanly until the end. Loved it!
Gestern, 03:40 Uhr von superkinkel
I loved figuring out the modular loop, but filling the central box was brutal for me. Took me about as long as the entire loop. One additional constraint would have made it a bit less frustrating at that point. Still a great puzzle.
Gestern, 02:51 Uhr von waffles_the_dog
This was really fun, it took me a moment to understand how the constraints worked together and then flowed really cleanly from there on. Thanks!
