All of my Advent of Code solutions, in Python for now.
Skipped problems
- 2016 19 (part 2)
- 2016 22 (part 2)
- 2016 23 (part 2)
- 2017 23
- 2018 12 (part 2)
- 2018 17
- 2018 19 (part 2)
- 2018 20
- 2018 21
- 2018 22 (part 2)
- 2018 23 (part 2)
- 2018 24
- 2019 10 (part 2)
- 2019 12 (part 2)
- 2019 13 (part 2)
- 2019 14
- 2019 16 (part 2)
- 2019 17 (part 2)
- 2019 18
- 2019 19
- 2019 20 (part 2)
- 2019 21
- 2019 22 (part 2)
- 2019 23
- 2019 24
- 2019 25
- 2020 18 (part 2)
- 2020 19
- 2020 20
- 2020 21 (part 2)
- 2020 22 (part 2)
- 2020 23 (part 2)
- 2020 24
- 2021 13
- 2021 15 (part 2)
- 2021 17
- 2021 19
- 2021 20
- 2021 21 (part 2)
- 2021 22 (part 2)
- 2021 23
- 2021 24
- 2022 14
- 2022 15 (part 2)
- 2022 16
- 2022 17
- 2022 18 (part 2)
- 2022 19
- 2022 22 (part 2)
- 2023 8 (part 2)
- 2023 10 (part 2)
- 2023 12 (part 2)
- 2023 14 (part 2)
- 2023 17 (part 2)
- 2023 18 (part 2)
- 2023 19 (part 2)
- 2023 20 (part 2)
- 2023 21 (part 2)
- 2024 17 (part 2)
- 2024 21 (part 2)
- 2024 24 (part 2)
Favorite problems
- 2016 11 (gave me a lot of trouble until using BFS with immutables)
- 2018 13 (minecarts)
- 2017 21 (expanding Conway, was elegant)
- 2022 21 (used eval trick to solve an equation)
- 2018 18 (cool Conway output)
Other problems to revisit
- 2015 19 (part 2) Seems to have an unusually variable input generation. My input cannot be solved by a simple approach almost like part 1's, but many people's, including a friend's and those of several bloggers, can. I landed on a stochastic approach but a pathfinding approach would be fun to revisit (as long as it had ways to pare down the combinatorial explosion that I experienced with a naive approach even when starting with the medicine and working towards shorter and shorter molecules).
- 2015 20 (find more efficient approach)
Text outputs to animate
- 2015 18
- 2018 18
- 2017 21?
Other
- replace occurrences of 'indeces' with 'indices'
- for rewrites
- replace astar function with the rewrite from 2016 13
- reconsider width = len(grid) ...