Thursday, 22 June 2023

Walker

Here’s a walkthrough for yesterday’s Parade Sums by Freddie: https://www.youtube.com/watch?v=pTohh-a5jPg

Today’s puzzle is a Meidjuluk! This genre is @glum_hippo ’s invention, and the focus of a recent Speed Setting Competition (entries here: https://discord.com/channels/709370620642852885/843561196308791296/1119623038858694806).

Rules: Divide the grid into regions of orthogonally connected cells. There must exist one region of each size from 1 to N, N being the number given outside the grid. A region may only contain numbers which are factors of the number of cells the region contains. Regions may not contain multiple instances of the same number.

Notation tip: This GAPP includes numbers from 1 to N to the right of the grid. Feel free to mark numbers corresponding to region areas you’ve used; please use Shading mode so that the answer check will still activate.

If you’re having trouble understanding the logic, check out this GAPP 101: if two numbers are part of the same region, its size must be as large as their least common multiple (LCM). If this LCM is larger than the maximum region size N, the numbers can’t be in the same region.

Example (Penpa): https://tinyurl.com/2o57t4t8

Solve in 4:30 or under for a Speedy Sloth! 🦥
Complete in 9:00 or under for a Quick Crab! 🦀
And all solvers who complete the puzzle will earn a Looking Long-eared Owl! 🐦

Puzzle (Penpa): https://tinyurl.com/2h8ktyal