## Source: Full of Hot Air

## Part 1

Let a Snafu number be a base 5 number with the curious property that in addition to the digits 0, 1, and 2, it has the numbers

`-`

as`-1`

and`=`

as`-2`

. Sum up a list of Snafu numbers.

Let a Snafu number be a base 5 number with the curious property that in addition to the digits 0, 1, and 2, it has the numbers

`-`

as`-1`

and`=`

as`-2`

. Sum up a list of Snafu numbers.

Given a map with a series of moving walls (that wrap when the hit the edges of the simulation), calculate the fastest route from the top left to the bottom right.

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

- Calculate a potential move:
- On each frame, rotate the order the directions are checked in (
`NSWE`

,`SWEN`

,`WENS`

,`ENSW`

,`NSWE`

, …)

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.

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.

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`

.

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

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?

There are a collections of

`Sensor`

s and`Beacon`

s. 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`

.

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.