Incoming links: NP-hard
Solution: move pieces to fill the gap on the fat object that crosses the screen. Place objects either on fat object or on other objects placed on the fat object. Anything you add must end in a rectangle.
The rules for this one are not entirely clear with the number of examples.
Also clearly if the goal is to make rectangular towers, then this is an NP-hard optimization problem in general.
Input primitives:
- same color chunk. Properties: crosses screen.
Transformation primitives:
- move solid around
- fills the gap
This existed earlier: x.com/GianpaoloGalli/status/1846144236900827413