Ciro Santilli @cirosantilli 37

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:

Transformation primitives:

This existed earlier: x.com/GianpaoloGalli/status/1846144236900827413

They are moving to 2d discrete AI games.

Although there is merit in that, it is a shame that it just similar to other pre-existing work such as gvgai and many others.

Solutions to these solutions require much more thought to formalize a solution.

Also the solutions are much less unique, finding the actual optimal solution being obviously NP-hard.

These aspects make those games much less elegant than the older ARC-AGI 1 and 2 counterparts.

A problem that is both NP and NP-hard.