Advent of Code Week 3 - you're lost in a maze of twisty mazes, all alike
https://awful.systems/post/3068344
=> More informations about this toot | More toots from gerikson@awful.systems
day 18
bit of a breather episode
As long as you ensure A* / Dijkstra’s (is there a functional difference if the edge weights are constant?) you’ll get the shortest path. Part 2 was just simulation for me, if I started in the state of part 1 it took a minute to run through the rest of the bytes.
=> More informations about this toot | More toots from gerikson@awful.systems
yesWhat is this, day 16?
=> More informations about this toot | More toots from swlabr@awful.systems This content has been proxied by September (3851b).Proxy Information
text/gemini