Source: Day 20: Race Condition
Full solution for today (spoilers!).
Part 1
Given a maze with exactly one path, find how many single walls you can walk through (remove) that shorten the best path by at least 100 units.
Full solution for today (spoilers!).
Given a maze with exactly one path, find how many single walls you can walk through (remove) that shorten the best path by at least 100 units.
Full solution for today (spoilers!).
You are given a series of points on a
71x71grid. Taking only the first 1024 points, how long is the shortest path from(0, 0)to(70, 70)?
Full solution for today (spoilers!).
Given a maze, what is the shortest path between
SandEwhere walking straight costs one and turning costs 1000.
Full solution for today (spoilers!).
Given a heightmap (
0to9), for each0count how many9you can reach on paths that only ever increase height by exactly 1 at a time. Sum these values.
Another Rust Solvers puzzle: Cosmic Express. Basically, it’s a routefinding puzzle. You have a train that needs a track from entrance to exit, picking up and dropping off cargo on the way.
It’s actual a relatively simple puzzle, so far as things go, but one thing that’s interesting from a solving perspective is that branching paths really don’t work great with my solver code. Paths just have a crazy branching factor when compared to (for example) playing one of a handful of cards.
But it’s still an interesting puzzle!