Friday, 3 April 2026

jovi_al

Hi! I'm still pulling from the backlog of puzzles I made in early January. Today's is one I had to refresh myself with, but it reminded me why I love Litherslink so much. This puzzle comes with a GAPP 101, and if you need a Litherslink refresher, here's a link to the last time we covered it, by me: Archive: Thursday, 12 June 2025.

The example uses the GAPP 101 technique, so if you'd like, see if you can figure it out from that! It's quite powerful. c:

Rules: Connect pairs of orthogonally adjacent dots to form multiple trees (groups of connected line segments that form no loops). At every dot, a tree must visit once, three times, or four times. A number indicates how many of its cell's edges are part of trees.

To earn a Speedy Sloth 🦥, solve today's puzzle in 3:00 or less!
To net a Quick Crab 🦀, solve today's puzzle in 6:45 or less!
All other solvers are welcome to their very own Snake-eating Secretarybird 🐦!

Example (pzprxs): https://tinyurl.com/2s3zsv79
Puzzle (pzprxs): https://tinyurl.com/2mpe5ky9

GAPP 101: If a tree terminates at a vertex, it must take none of its adjacent dots. This often affects 3s. If a tree does not terminate at a vertex, it must take at least two of its adjacent dots. This often affects 1s.