Given a series of given a series of
blueprints, each of which gives instructions for how to build a singlerobotfrom a collection ofmaterialsthat in turn will produce one of a givenmaterialper turn, determine the best order of builds to maximize yourgeode(the most valuablematerial) production for eachblueprintgiven a time limit of24 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
Sensors andBeacons. As input, you are given theBeaconclosest to eachSensor(using Manhattan Distance). If aBeaconis not closest to any sensor, it will not appear in this list. Calculate how many points in the given row (y=2000000) cannot contain aBeacon.
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.
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.
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.
Rust, yet again! Let’s take what we did last time with Solving Sudoku (again) and improve the code structure a bit more.
Goals:
If you’d like to follow along, I’ve started uploading the code here: https://github.com/jpverkamp/rust-solvers
More Rust! This time, I want to go back to my post on A Generic Brute Force Backtracking Solver. For one, because I’m learning Rust. For two, because there is a crate specifically for im
mutable data structures. And for three, because I expect it will be much faster. We shall see!