advent21
advent-2021
advent21 | advent-2021 | |
---|---|---|
2 | 19 | |
0 | 5 | |
- | - | |
0.0 | 6.8 | |
over 2 years ago | over 1 year ago | |
Nim | Rust | |
Apache License 2.0 | - |
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.
advent21
-
Help regarding 2021 Day 19
You can try to read my walkthrough... You cannot just match one edge to another edge, as there may be match in magnitude but are in fact totally off. You have to test for all edges, and you'll eventually know if two scanners line up if there's more than just two 'lucky' points (i.e. edge) that exists for both scanners.
-
-🎄- 2021 Day 23 Solutions -🎄-
Nim with my walkthrough here. Similar to the other solutions, just brute-forcing all possible moves for Dijkstra's algorithm. My walkthrough simply explains how to figure out the valid moves to do so, turns out it isn't too hard after having written it down (and simplifying my code).
advent-2021
- -🎄- 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 -🎄-
What are some alternatives?
Red-Team-Advent-of-Code - Red Teaming / Pentesting challenges for my Advent-Of-Code 2021.
aoc2021 - Advent of Code 2021 - my answers
Advent-Of-Code - My solutions to all Advent of Code questions
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
aoc2021 - My Advent of Code 2021 solutions, in Rust.
aoc2021 - Advent of Code 2021 on my homemade 16-bit CPU SCAMP
adventofcode - My solutions for Advent of Code
deno_aoc - 🎄 Advent of code solutions written in TypeScript for Deno.
adventofcode - ES6 solutions to Advent of Code puzzles.
aoc - Advent of Code - mscha's Perl 6 solutions
adventofcode - Advent of Code challenge solutions
AdventOfCode2021.jl - Advent of Code 2021 in Julia