Source: Unstable Diffusion

Part 1

Implement a cellular automaton with the following rules:

• If you have no neighbors, don’t move (important, I forgot this one for a while)
• Otherwise:
  • Calculate a potential move:
    • If you have no neighbors to the north, move north
    • If not, check likewise for south, then west, than east
  • If no other agent is moving to the same space, move to your potential move
  • Otherwise, don’t move
• On each frame, rotate the order the directions are checked in (NSWE, SWEN, WENS, ENSW, NSWE, …)

read more...

Source: Monkey Map

Part 1

Given a map and a series of instructions formatted as distance + turn (L or R), find the final position. Any time you would walk off the edge of the map, wrap to the opposite edge.

read more...

Source: Monkey Math

Part 1

Given a series of equations of either the form dbpl: 5 or cczh: sllz + lgvd, determine what the value of the node labeled root is.

read more...

Source: Grove Positioning System

Part 1

Given a list of numbers mix them by moving each number forward/backward in the list based on it’s value. For example, in 4, -2, 5, 6, 7, 8, 9 moving the -2 will result in 4, 5, 6, 7, 8, -2, 9. Each number should be moved exactly once in the original order they appeared in the list.

read more...

Source: Not Enough Minerals

Part 1

Given a series of given a series of blueprints, each of which gives instructions for how to build a single robot from a collection of materials that in turn will produce one of a given material per turn, determine the best order of builds to maximize your geode (the most valuable material) production for each blueprint given a time limit of 24 minutes.

read more...

Source: Boiling Boulders

Part 1

Given a list of 1x1x1 cubes, determine the total surface area of the cubes.

read more...

Source: Pyroclastic Flow

Part 1

Simulate Tetris on a 7 wide board with a given (infinitely repeated) series of left and right inputs to be applied on each frame before dropping the block and a given (infinitely repeated) set of blocks. Once 2022 blocks have been dropped, what is the total height of the placed blocks?

read more...

Source: Proboscidea Volcanium

Part 1

Given a graph of nodes, some of which have a pressure (per tick output value) and an agent that can move through the graph and activate specific nodes (so that they output their per tick value every future tick), what is the maximum total output possible in 30 steps?

read more...

Source: Beacon Exclusion Zone

Part 1

There are a collections of Sensors and Beacons. As input, you are given the Beacon closest to each Sensor (using Manhattan Distance). If a Beacon is not closest to any sensor, it will not appear in this list. Calculate how many points in the given row (y=2000000) cannot contain a Beacon.

read more...

Source: Regolith Reservoir

Part 1

Given a series of walls as input, run a falling sand simulation until any new sand falls of the map. Count how many grains of sand we end up with.

read more...