AoC2021
By SwampThingTom
advent-2021
[Moved to: https://github.com/Crazytieguy/advent-of-code] (by Crazytieguy)
AoC2021 | advent-2021 | |
---|---|---|
7 | 19 | |
1 | 5 | |
- | - | |
3.6 | 6.8 | |
over 2 years ago | over 1 year ago | |
Python | Rust | |
- | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
AoC2021
Posts with mentions or reviews of AoC2021.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-21.
-
-🎄- 2021 Day 22 Solutions -🎄-
I used the same basic idea in my non-recursive solution. However mine is MUCH slower, probably because it requires a lot of list manipulation that isn't necessary in the recursive approach.
-
-🎄- 2021 Day 21 Solutions -🎄-
Part 2, on the other hand, was more much complicated. I noticed beforehand that it was unfeasible to simulate every last of the trillions of possibilities, that it was necessary to keep track of the win counters in some other form. But I could not figure out initially how to do it. I looked this thread for ideas, and managed to understand the strategy. Credits go to u/SwampThingTom for the idea ([this comment](SwampThingTom), and the code behind it). After understanding the approach, I implemented it on my code (instead of copy/pasting).
-
-🎄- 2021 Day 18 Solutions -🎄-
Python using a graph of nodes.
- -🎄- 2021 Day 11 Solutions -🎄-
-
-🎄- 2021 Day 7 Solutions -🎄-
Python
-
Unofficial AoC 2021 Participant Survey
Nothing other than this year's Advent of Code. Decided to use it for AoC as a way to see what I can do with it.
-
-🎄- 2021 Day 5 Solutions -🎄-
Day 5 - Hydrothermal Venture
advent-2021
Posts with mentions or reviews of advent-2021.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-23.
- -🎄- 2021 Day 24 Solutions -🎄-
- -🎄- 2021 Day 23 Solutions -🎄-
-
-🎄- 2021 Day 22 Solutions -🎄-
Rust https://github.com/Crazytieguy/advent-2021/blob/master/src/bin/day22/main.rs Imagining the geometry of this was very tricky for me. For a while I contemplated if calculating the intersection of each pair of cuboids would give me enough information to know how many cubes are on at the end, and finally decided that I would also have to calculate the intersections of those and so on, so I gave up. Instead I decided that my state will be a vector of cuboids that are garuanteed to be non overlapping, and on each command I would subtract the current cuboid from each of these non overlapping cuboids (leaving 1 to 6 cuboids depending on intersection), and finally either add in the current cuboid (for on command) or leave it out (for off).
- -🎄- 2021 Day 21 Solutions -🎄-
- -🎄- 2021 Day 20 Solutions -🎄-
- -🎄- 2021 Day 19 Solutions -🎄-
- -🎄- 2021 Day 18 Solutions -🎄-
- -🎄- 2021 Day 16 Solutions -🎄-
- -🎄- 2021 Day 15 Solutions -🎄-
- -🎄- 2021 Day 14 Solutions -🎄-