Logic Masters Deutschland e.V.

[TSL][S1T5] Tunnel Vision

(Eingestellt am 22. Mai 2025, 21:01 Uhr von KenGlue)

This puzzle was my submission for turn 5 of the Skunkworks League, hosted by damasosos92.
The rule was originally created by SebastianSimon . You can find the puzzle "Path with opposite crosses" here.
You can also find introduction puzzles by damasosos92, as well as links to 2 other (and harder) recoil puzzles here.


Rules

Starting at the black diamond, draw a directed path through the centers of some cells in the grid. Path segments are drawn sequentially from cell to cell, such that the first path segment is drawn from the black diamond to an adjacent empty cell, the second segment is drawn from that cell to the next empty cell, and so on until the final segment is drawn and the path ends.

The path cannot branch or revisit a cell it has visited before.

Every time the path enters a new cell, a “recoiled cell” is placed in the first empty cell in the opposite direction. This recoiled cell may skip over gaps in the grid, other recoiled cells, or other path cells.

The path cannot enter a cell if its corresponding recoiled cell cannot be placed into the grid.

All cells of the grid must be visited by the path or contain a recoiled cell.




The Puzzle



Hope you enjoy the puzzle!

Lösungscode: Contents of row 5, followed by row 13 (fifth row from the bottom). Don't put any separating characters.

Write O if the path enters the cell, write X if it doesn't.


Gelöst von damasosos92, Piatato
Komplette Liste

Kommentare

am 22. Mai 2025, 22:58 Uhr von Piatato
Fun puzzle, thanks!

am 22. Mai 2025, 21:39 Uhr von damasosos92
And you will probably see a lot more of them, jessica6. At least 35 people set a recoil in the last few weeks, and they are publishing them now that the turn ended!

am 22. Mai 2025, 21:34 Uhr von jessica6
Die werden auch immer größer...
gerade hab ich erst das von Donatello_86 gelöst.

Schwierigkeit:4
Bewertung:N/A
Gelöst:2 mal
Beobachtet:0 mal
ID:000NHR

Online-Solving-Tool Wegerätsel

Lösung abgeben

Lösungscode:

Anmelden