The numbers each represent the number of neighboring fields visited by the loop on a segment, where each '?' stands for a positive integer. If a field contains more than one number, each number corresponds to a segment and between two segments the loop must visit a different field.
Solution code in the example: 53
The puzzle (Penpa):
Solution code: In reading direction for each field with '?' the greatest value for one of the '?'.
on 6. September 2024, 03:43 by DiMono
git.io links are dead. Here's the puzzle on Penpa+ with answer check: https://tinyurl.com/32eajvft
on 3. January 2022, 18:06 by zuzanina
Sehr schöne Rätsel-Kombination!
Difficulty: | ![]() |
Rating: | 97 % |
Solved: | 25 times |
Observed: | 8 times |
ID: | 0008PL |
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.