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.

AoC 2022 Day 14: Sandinator

2022-12-14

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.

AoC 2022 Day 12: Climbiantor

2022-12-12

Source: Hill Climbing Algorithm

Part 1

Given a height map, find the shortest path between two points such that the path can descend any distance but can only climb by a maximum of 1.

AoC 2022 Day 8: Treetopinator

2022-12-08

Source: Treetop Tree House

Part 1

Given a grid of numbers, count how many of these numbers have a direct path in any cardinal direction to the edge of the grid.

Stateful Solvers and Iterators

2022-10-16

Rust, yet again! Let’s take what we did last time with Solving Sudoku (again) and improve the code structure a bit more.

Goals:

Create a ‘Solver’ struct that can maintain state (such as how many states we’ve visited, how much time we’ve spent)
Track the above stats
Turn the ‘Solver’ into an iterator which will iterate through given solutions (a single call will give the first solution or you can run through the iterator to get all of them)

If you’d like to follow along, I’ve started uploading the code here: https://github.com/jpverkamp/rust-solvers