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 German Whispers line (i.e., adjacent digits on the loop must have a difference of at least 5).
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.
Solution code: Digits on the loop in row 1 (left to right) followed by digits on the loop in column 8 (top to bottom)
on 28. July 2025, 19:38 by wuc
Great loop puzzle. Loved it thx.
on 22. July 2025, 03:33 by virus_dave
A very lovely puzzle, thank you!
on 20. July 2025, 07:13 by CaptRob
Beautiful setting! Thanks yttrio!
on 19. July 2025, 18:36 by ColleDK
I would rate this a bit harder than 2*. As VitP said you need to know the checkerboard rule to solve this
on 19. July 2025, 15:48 by madhupt
This is a very smooth puzzle. Solving a yttrio always gives me a lot of satisfaction and this one is no different. Thanks for sharing this.
on 19. July 2025, 12:56 by Playmaker6174
A fun solve with a sweet minimalist setting :)
on 19. July 2025, 12:11 by Franjo
A perfect introduction for those people who haven’t tried to solve a Whispers Loop yet! Thank you very much for creating and sharing this lovely puzzle.
on 19. July 2025, 10:20 by galium_odoratum
Beautiful puzzle with wonderful flow!
on 19. July 2025, 03:47 by VitP
there are a couple advanced features of german whisper loops (*) that the solver must know. beginners will not know these things, and are unlikely to derive them from scratch.
(*1) globally, the loop is a subset of a chessboard pattern.
(*2) if there is too much of a loop in a given region, it may overload the ability of the loop to accommodate certain digits, i.e. 4&6.
on 19. July 2025, 02:58 by mihel111
A simple ruleset. A sparse grid. A very doable puzzle. That's genius.
Very well done, yttrio.
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.