Broken Sign Blog
#093: Heyasnake (Solitary)
29 April 2023This was another of my entries to the most recent Logic Showcase. Halfway through constructing the other entry, I wondered whether there should be a restriction on how many snakes can visit a region. I ultimately decided to call this a variant because it doesn’t feel integral to the ruleset, but it results in a bunch of interesting logic that seems worth exploring.
Rules: Shade some snakes so that no two snakes are orthogonally adjacent and the remaining unshaded cells form one orthogonally connected area. A snake is a 1-cell wide, unbranching path of at least two shaded cells. Numbered regions must contain the indicated amount of shaded cells. A straight line of consecutive unshaded cells may not cross more than one bold border.
Variant: Solitary — At most one snake may visit any region, but may do so any number of times.