Ciro Santilli @cirosantilli 37

There is no unique solution, we just have to optimize something, often the least changed colors.

An "object" is a set of points that is understood to be one singular entity.

Contiguity and having the same color are strong indicators that something should be understood as an object.

If a color is inferred to be a background color, it contains no information and should be ignored.

Most problems tend to use black as a background color, but not all of them.

This section lists transactions from 2011 that appear to contain pools of vanity addresses. There were first discovered while researching Base58 messages, but since they just contain bulk commercial stuff with little artistic value we've decided to keep them here instead of in the museum:

Input: three or more containers:

Output:

Input:

Output:

Input:

Output:

TODO I can't solve that one.

Input primitive:

Transformation primitives:

Solution: vs are guns that shoot diagonal line of their color, when line touches another object, change line color to match that of the object, then bounce on the object and continue going with the new color

Input primitives:

Assumptions:

Transformation primitives:

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

Input primitives:

Transformations primitives:

To the left of the vertical red line, count the number of each color on each row.

Then to the right, on each line draw one square of each color to the left every n columns, starting with a square on the first column to the right of the red line, where n is the count of that color.

Start with the color furthest away from the red line, and then color with colors nearer to the red line. If there's overlap, replace the old color with the new one.

Input:

Output:

These section lists common visual primitives that a solver must first extract in order to infer solutions.

Some of these have a lot of prior world content, others less.

Many people have come up with the same idea on the Discord. Some nicely call it DSL.

Implementations:

Some early ones we can find:1Ga9Dizn1p6ctGWausC1osLSrXFdioxide which ends in "dioxide" (7-letter), and is spendable