advent-of-code VS advent-2021

Code lives here and I scheduled a [blog post here](rope-bridge-solving-advent-of-code).

In the rest of the code I simply iterate through cubes and multiply the edges with the saved values.

Today was rough. Code is too long to post here. Github Basically using indexes and a bit of recursion for this.

It lives on Github and I made a visualization.

Python 3. Figured I'd learn some more networkx. Was useful for the "smol" attribute in the end and easily getting the neighbors. Full code is on Github.

The two scorer functions live on Github.

The full code with comments lives on Github. But here's the meat without comments for brevity:

And this is how simple it can be to build some relatively robust tests. All of this lives in a tests folder so pytest automatically finds it in a file called test_day05.py. You can see the file on Github.

Kept it fairly simple in Python. Runs in half a second for both parts together.

Rust https://github.com/Crazytieguy/advent-2021/blob/master/src/bin/day22/main.rs Imagining the geometry of this was very tricky for me. For a while I contemplated if calculating the intersection of each pair of cuboids would give me enough information to know how many cubes are on at the end, and finally decided that I would also have to calculate the intersections of those and so on, so I gave up. Instead I decided that my state will be a vector of cuboids that are garuanteed to be non overlapping, and on each command I would subtract the current cuboid from each of these non overlapping cuboids (leaving 1 to 6 cuboids depending on intersection), and finally either add in the current cuboid (for on command) or leave it out (for off).