Skip to main content
Puzzling

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

9
  • $\begingroup$ Hi Jaap, thanks for answering! Although I didn't state explicitly, it would be preferable if you can also prove that your result is minimal (: $\endgroup$
    – WhatsUp
    Commented Apr 29, 2021 at 15:27
  • 4
    $\begingroup$ I think you can proofify your argument by instead of regarding seams between entire ranks/files using only those between squares on the outermost ring. That way you get two groups of 14 requirements, only rectangles spanning the entire length or width can satisfy the maximum 4 of them and contributing to both groups at the same time can only be done in increments of one each. $\endgroup$
    – loopy walt
    Commented Apr 30, 2021 at 0:49
  • 1
    $\begingroup$ "proofify", I like that word. $\endgroup$
    – justhalf
    Commented Apr 30, 2021 at 4:42
  • $\begingroup$ @loopywalt Thank you, that does the trick! I'll update my proof. $\endgroup$
    – Jaap Scherphuis
    Commented Apr 30, 2021 at 6:53
  • $\begingroup$ Now it's a perfect answer (: Good job both Jaap and @loopywalt! $\endgroup$
    – WhatsUp
    Commented Apr 30, 2021 at 10:20