Thursday, 23 June 2022

jovi_al

[insert intro here: jovi edition]

All or Nothing!

Rules: Draw a non-intersecting loop through the centers of some cells. A region may be visited by the loop at most once, and if it is, all of its cells must be visited. Two orthogonally adjacent regions may not both be unused.

As always, an example puzzle and its solution are attached to the image of today's puzzle. Solve the example here, if you wish (Penpa+): https://tinyurl.com/2fpegz24

To earn yourself a Speedy Sloth 🦥 solve today's puzzle in 1:45 or less!
To net yourself a Quick Crab 🦀 solve today's puzzle in 4:30 or less!
All solvers are well-deserving of a Tired Tufted Titmouse 🐦

Solve today's GAPP here (Penpa+): https://tinyurl.com/2oaphmuu