[TSL][S1T2] At the Edge of the Future (Variant Foreshadow)
(Eingestellt am 14. Januar 2025, 02:33 Uhr von The Book Wyrm)
This puzzle was created for the Sunkworks League. The prompt for this round was to make a song based on/inspired by the song The Boy. My puzzle included a lot of flavour text to link it to the song; this has been included at the end of the rules in the solving link.
Rules:
- Draw a non-intersecting path that moves orthogonally through the centers of all cells, starting from one of the Xs and finishing at the other.
- A clue N in a cell indicates that the path leaves the Nth cell after visiting the clue in the direction indicated by the arrow.
- Additionally, the path is split into three parts:
On the first section, from the start until the path passes through the flower, all clues must be liars (i.e. the path must not leave the Nth cell after visiting the clue in the indicated direction). - On the second section, from when the path passes through the flower until the path passes through the sea, all clues are standard.
- On the third section, from when the path passes through the sea until it reaches the end, all clues are knapp-daneben - the actual value is one different than the value given - i.e. the path must leave either the (N-1)th cell or the (N+1)th cell after visiting the clue in the indicated direction.
Note: A clue cannot have it's value reduced to 0. - Clarifications: a clue may refer to a line segment beyond it's section, and in that case the clue must still be fufilled (i.e. if there is a 5 clue in the second section, the 5th cell after visiting it must be left in the indicated direction, even if that cell is in the third section). A clue cannot refer to a segment beyond the end of the path.
For aditional clarity an example of a valid grid has been given. The different sections of the path has been coloured to indicate how they work. Red indicates all clues passed through are liars, green indicates standard clues, and blue indicates knapp-daneban clues.
Penpa link: Click Here
Lösungscode: For each row of the grid, the number of times the path turns in that row.
Kommentare
am 24. Februar 2025, 04:27 Uhr von MaizeGator
Very nice connectivity logic. This one was initially intimidating, but not too hard once I got started (even though I broke it multiple times, I usually found I knew where to look)
am 17. Januar 2025, 02:21 Uhr von askaksaksask
There is some really wonderful logic that emerges out of the constraints, and it took me a good bit of "sit and stare" before I could really get an effective foothold. I like the logic that feeds the break in, and I appreciate the preliminary steps to tease out the initial line affiliations. The puzzle felt much less demanding after, but no less smooth or rewarding. I'm so glad I put this one on my list! Thank you!!
am 14. Januar 2025, 21:11 Uhr von damasosos92
This was brilliant and utterly astonishing. This puzzle features one of the best break-ins I've ever seen in my life.
am 14. Januar 2025, 10:51 Uhr von The Book Wyrm
Fixed rules
am 14. Januar 2025, 10:00 Uhr von jessica6
isn't there something missing? There is no description what you actually have to do (Draw a non-intersecting path that moves orthogonally through the centers of all cells, starting from one of the Xs and finishing at the other.)?
Also, in the 3rd paragraph (also in penpa), a "loop" is mentioned but it is only a path, not a closed loop.
---------------------
You're correct, I accidentally didn't copy the full rules when I typed up the LMD page, that has now been fixed.
(As has the mention of a loop, which should just have been a path)
am 14. Januar 2025, 09:29 Uhr von Piatato
Amazing puzzle! It's almost unbelievable how every step can be so good!
am 14. Januar 2025, 08:22 Uhr von Fool on Hill
This was beautiful, but seriously hard. Definitely one of my favourite hard puzzles.
