AoC 2022 Day 23: Elf Scattinator

2022-12-23

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, …)

AoC 2022 Day 22: Wonderator

2022-12-22

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.

AoC 2022 Day 21: Yellinator

2022-12-21

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.

AoC 2022 Day 19: Blueprintinator

2022-12-19

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.

AoC 2022 Day 18: Lavinator

2022-12-18

Source: Boiling Boulders

Part 1

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

AoC 2022 Day 16: Pressurinator

2022-12-16

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?

AoC 2022 Day 15: Beaconator

2022-12-15

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.