Logic Masters Deutschland e.V.

[TSL][S1T5] Recoil: Angelfish

(Published on 22. August 2025, 21:59 by FischmitFahrrad)



This was part of a Setting Competition held in 2024/2025. The Skunkworks League was hosted by @damasosos92.
The competition took place in a total of 7 turns with a unique prompt for each round. Setter's had to create and test a unique puzzle for each prompt solely by themselves.

As of the prompt for Turn 5 of TSL the goal was to create a Recoil as invented by @SebastianSimon in his puzzle Path with opposite crosses.

@damasosos92 also created some easy introduction puzzles for this genre as well. These also include a few examples for the ruleset and can be found here:
Recoil: An Introduction
Recoil: A Proper Introduction
Recoil: No Longer an Introduction


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.

Solve online (pzprxs).


Solve online (Penpa+).


Solution code: For each row the path visits the number of turns the path takes in that row (12 digits total).

Last changed on on 8. October 2025, 15:57

Solved by Piatato, damasosos92
Full list

Comments

on 22. August 2025, 22:53 by FischmitFahrrad
Clarified the solution code.

Last changed on 22. August 2025, 22:54

on 22. August 2025, 22:40 by Piatato
Really nice and fun puzzle!
Btw, the solution code doesn’t include rows that aren’t visited by the path.
- - - - - - - - - - - - - - - - - - - - - - -
Thanks for the kind words and for pointing that out! Clarified that in the description.

Difficulty:2
Rating:N/A
Solved:2 times
Observed:0 times
ID:000OTX

Path puzzle

Enter solution

Solution code:

Login