Logic Masters Deutschland e.V.

LM 2026 Leftover: A 38 (2)

(Published on 1. July 2026, 20:26 by tuace)

Draw a directed loop through the grid that runs horizontally and vertically, starts and ends in the black circle, and passes through each cell except those with numbers exactly once.

Along the loop, a traveler passes through several grey cells. To be allowed to do so, a pass A 38 is required and will be obtained in cells horizontally, vertically and diagonally neighbouring to cells with numbers. The clue numbers refer to the order in which all neighbouring cells are visited. If N is one of these numbers, and the traveler visits one of these adjacent cells for the N-th time, the traveler receives exactly one pass. If such a cell is also adjacent to other clue cells, it is generally identified by all of them; however, the traveler still receives exactly one pass.

If a grey cell is adjacent to a numbered cell, it is counted in the order in which it is visited, but it can never be the N-th adjacent cell. This means that no pass can be obtained on grey cells.

When traveling through a grey cell, the traveler must have exactly one pass which is then revoked; in other words, the traveler must alternately obtain and use the passes. In the cell with the black circle, the traveler does not have a pass.

Solution code: The number of turns of the loop in each row, from top to bottom.

Last changed on -

Solved by Piatato, Jesper, Zzzyxas, Agent, ibag, uvo, cyddrdrd, lupo, Paletron, MaizeGator, r45, JustinTucker, KNT, CJK, misko, PurzelWurzel
Full list

Comments

on 5. July 2026, 17:58 by MaizeGator
Outstanding! Really enjoyed the ending, although it fooled me a few times.

Last changed on 4. July 2026, 14:00

on 4. July 2026, 13:59 by cyddrdrd
Clean and nice!
URL: https://tinyurl.com/24xucejs

on 2. July 2026, 03:58 by Agent
Awesome!

on 1. July 2026, 21:06 by Piatato
Very nice solvepath!

Difficulty:3
Rating:98 %
Solved:16 times
Observed:1 times
ID:000TFR

Path puzzle

Enter solution

Solution code:

Login