Saturday, 5 August 2023
Walkthrough for yesterday's Turn-and-Run: https://youtu.be/8PnqRBP8O6s
Coming up to the character limit as I write this intro. Which means you're about to get both a witty introduction and a logical fallacy. Discord would be much worse with a 4000 character limit just as Charlie and the Chocolate Factory would be with ten.
Today's puzzle is a SUPERSIZED Nanameguri, which means hearty congratulations go to @atroposhears for claiming the first bonus otter this month! 🦦 (It's also the only otter we had, so we'd better start looking for other otters...). And this is a bachelor otter so it writes one puzzle every day.
Rules: Draw a non-intersecting loop through the centers of some cells which passes through each region exactly once. Each cell containing a diagonal portion of a region boundary must be used by the loop, but the diagonal portion cannot be passed through. In other words, the loop must make a 90° turn, as though reflected off of it. (The loop cannot reflect off the diagonal line on both sides)
GAPP 101: Much like in Country Road (see Menderbug's GAPP:), the constraint that each region is visited exactly once is powerful - it means that if a region already has two entrances, then these segments will have to connect directly.
Feel free to attempt the previous appearances of Nanameguri in GAPP:
- (by Lavaloid)
- (by me)
For a Speedy Sloth 🦥 , solve in 6:30 or less!
For a Quick Crab 🦀 , solve in 14:00 or less!
And all solvers who finish are rewarded with a Portly Po'ouli 🐦
Example (Puzz.link) from puzz.link rules page: https://tinyurl.com/5aaff8me
Puzzle (Puzz.link): https://tinyurl.com/5p53sjfk
