#Day 24 Blizzard Basin
opal shard
opal shard
rank 954 for part 2, 48 ms run time
https://github.com/BreadFish64/AOC2022/blob/master/AOC/blizzard_basin.cpp
Way simpler than it seems at first.
||I just marked all spaces where you could be. Each round I expand to all adjacent spaces, then erase the spaces a blizzard moved into.||
versed totem
oh that's pretty smart. || i just did A* pathfinding ||
versed totem
got it to 24ms using your method
covert nova
So glad I wrote part 1 in a way that let part 2 be solved really easy
ended up having to add three lines - ||one to force a "start time", and then an extra pathfind from the end of the p1 stuff to start, then end of that to end again||
In this case ||the sum of the shortest segments is the best path because you could just wait arbitrarily long at the start||
opal shard
oh that's pretty smart. || i just did A* pathfinding ||
I have yet to implement any form of ||A*|| 
opal shard
