Miracle German Shingoku
(Published on 2. July 2024, 23:58 by juleswg)
This is my first puzzle submission, and I'm very excited to see how folks do!
Sudoku rules apply.
Draw a single closed loop that travels orthogonally through the centers of some cells. The loop does not use any cell more than once and must travel through each colored square in the following way:
- The loop must turn 90 degrees upon reaching the purple squares, and may not turn on the blue squares.
- The value in each colored cell is the sum of the number of squares seen by the the 2 straight lines going out of that square, including itself. (This loop loosely follows the rules of the pencil game Shingoki.)
- Non-purple and non-blue adjacent digits on the loop must differ by at least 5. The loop acts as 17 German whisper lines excluding the blue and purple squares.
- Cells joined by an X sum to 10. Not all X's are given.
Use this link if you would like to solve on Sudoku Pad.
And here is a Penpa link if you would like to use their online solver.
Happy solving!
Solution code: Row 8 digits from left to right.
Comments
on 4. July 2024, 18:04 by juleswg
Thank you sanabas!
on 4. July 2024, 12:27 by sanabas
Fun solve. Some intricate thinking to get started, then flows nicely.
on 3. July 2024, 16:32 by juleswg
The note in the your edited comment is correct. The german whispers are "reset" upon passing through a purple or blue square. Many whispers thus have length 1 and can be ignored.
on 3. July 2024, 16:27 by juleswg
Added SudokuPad link
on 3. July 2024, 09:14 by sanabas
So just to clarify I'm understanding the rules correctly, say the line goes r2c7-r3c7-r3c8, and r3c7 is purple, that means r2c7 and r3c8 differ by 5+? Even though those two digits aren't adjacent to each other?
edit - actually, I think that's physically impossible due to the orthogonal movement + odd number of coloured squares.
So the loop is a series of 17 independent whisper segments?
