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.
Output:
- draw dotted lines
Input primitives:
- background color
- squares
- points
Transformations primitives:
- line drawing
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
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:
- diagonal line
Assumptions:
- line don't cross each other, it is unclear how to resolve that case
Transformation primitives:
- draw line
- draw line and bounce
Input primitive:
Transformation primitives:
- draw lines
Input:
- background color
- boxes
- points inside boxes
- distance between point and box
Input: three or more containers:
- one touching top left corner
- inside it there are three monocolor objects
- one touching bottom right corner of toplevel box
- inside it there is one monocolor object
- outside of those, touching the left toplevel box edge, there is one or more point
Output:
- draw dotted path of perpendicular line
Articles by others on the same topic
There are currently no matching articles.