advent-code-2021 VS adventofcode

(physicist here) see lines 5-12 of my solution, where I use some numpy and nested for-loops to generate all 3x3 permutation matrices with signs flipped and determinant +1. There turns out to be exactly 24 of these, and they are the right ones.

My A* in Rust only stores (position, time) as state, as you can deduce where the blizzards are after N minutes: code. This is quite expensive, though, as you need to run it for each node expansion (unless you do caching).

Rust.

"Python", 146/146. Part 1 working out, Part 2 working out

Python, 407/8. Part 1, Part 2, Part 2 cleaned up. How did y'all do part 1 so quick?

Python, 198/34. Part 1, part 2 is below as it's mostly self-contained.

Python, 6/3. Part 1, Part 2. The main "tricks" I used were:

Python, didn't leaderboard. Cleaned up code for part 1 and part 2.

Python, 8/28. Part 1, Part 2. My part 2 turned the input into "a Counter of adjacent pairs of characters", which you need to be careful about because turning that to "a Counter of characters" is not easy - you double-count all characters except for the first and last which cost me an incorrect submission!

its like 600 lines, I recommend writing your own so that the functions make sense for you. Here is the "library" from someone that gets on the global leaderboard (mcpower): https://github.com/mcpower/adventofcode/blob/master/2020/01/utils.py