As a warmup for this year鈥檚 Advent of Code, I鈥檓 re-reading and posting my solutions to last year鈥檚 challenges. You can read, run and edit today鈥檚 solution by following the post link.
Today had us running round a maze with moving obstacles. Treating time as a dimension allowed me to build a graph and find the shortest path. Part 2 just required doing this three times. This took me closer than I like to a full second runtime, but not close enough to make me re-think my solution.
You must log in or # to comment.