Draw a loop in the grid that travels orthogonally between the centre of cells and visits EVERY cell.
Every cell contains a digit. For each cell with an arrow, the digit counts the number of loop corners seen in the indicated direction, not including itself. For ALL remaining cells, such an arrow must be able to exist, pointing in an orthogonal direction to at least one cell.
Cells sharing an edge contain digits with a difference of at least 1, and cells connected by loop contain digits with a difference of at least 2.
Solution code: Row 1 (top), left to right
today, 08:57 by Piatato
Cool!
| Difficulty: | ![]() |
| Rating: | 80 % |
| Solved: | 12 times |
| Observed: | 0 times |
| ID: | 000TP2 |
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.