At Mondrian Art Problem I have updated code. A community post on the Mondrian problem talks about the related video. Basically, you want to divide a square into non-congruent rectangles so that the difference in the large/smallest areas is as small as possible. Since the video came out there have been many improvements by myself, Hannes Bassen and R. Gerbicz.

At Tightly Packed Squares, squares of size 1 to $n$ are packed into the smallest possible rectangle. I thought that combining my code might make an interesting poster.

Yep, that looks entertaining.