Bounding Boxes
These were made between 11/28/24 and 12/1/24 while exploring the idea of giving shaded regions bounding boxes. I really like how the logic ended up having depth to it: these puzzles rely on some special theory that I don't think applies to any other puzzle I've seen before.
Rules: Shade some cells and divide the grid into rectangular regions such that each rectangular region is the smallest possible grid-aligned bounding box for each orthogonally-connected mass of shaded cells. (That is, the shaded cells in each region collectively touch every edge of the region but are never adjacent to the shaded cells of other regions.) Numbers reveal the area of the shaded mass in the same box and cannot be shaded.
The first has been solved in the picture below as an example.
Comments
Post a Comment