Vexed by Convexity, part two

March 25th, 2018 by munizao Leave a reply »

Previously, on Vexed by Convexity, we looked at various measures of convexity as applied to the pentominoes. In order to turn these measures into interesting puzzles, we can try to minimize their values for some family of polyominoes. Arrangements of tetrominoes were one that I found to make good puzzles.

Why minimize convexity? Well, we could maximize, but the different measures converge as we approach a convexity of one, so if we want different puzzles, minimal convexity is a better bet. To mangle Tolstoy, all happy (i.e. convex) polyominoes are alike; every unhappy polyomino is unhappy in its own way. On to the problems:

Problem #46: Find the least convex connected arrangement of the tetrominoes, where convexity is defined as Area / Convex Hull Area. Here is my best attempt, with convexity = 20/55.5 ≈ 0.36036:

Problem #47: Find the least convex connected arrangement of the tetrominoes, where convexity is defined as Convex Hull Perimeter / Perimeter. Again, my best attempt, this time with convexity = (14 + 5√2) / 40 ≈ .5268:

You might be expecting the probabilistic definition of convexity defined in the previous post to be next, but it’s a little unsatisfactory. Checking enough segments to have a good estimate would be computationally intensive, and it’s hard to know how many segments is enough to separate any pair of polyominoes that are competing for minimal convexity. (Presumably there is some way to calculate exact values, but I don’t know it.)

But we can cheat. If we check only segments connecting the centers of squares, we have a reasonably bounded quantity of segments to check. This is at the expense of no longer having a valid convexity measure (for example, this method would find the P pentomino to be convex.) But that’s fine; what we really care about is just having a good puzzle.

Problem #48: Define the “convexity” of a polyomino as the proportion of segments connecting the centers of squares within the polyomino that remain entirely within the polyomino. (The border counts.) Find the least “convex” connected arrangement of the tetrominoes. My best attempt, with convexity = 51/190 ≈ .2684:

Leave a Reply