advent-of-code-2022 VS aoc2022

Slow dlang solution that simulates sand drops one grain at a time, one pixel at a time. Here's the main loop for part 2. The occupied[grain] = true assignment is due to the fact that the standard library doesn't have a hashset (to my knowledge), so instead I'm putting Points in an associative array while discarding the values.

Dlang solution, using JSON parsing from the standard library. At first I misunderstood the problem and kept getting failures in the second pair. I thought [2,3,4] vs [4] meant that the right list will run out of items after having successfully compared 2 and 4, but then I learned that this would only happen if 2 and 4 were equal (thanks to this thread). This made me realize that a binary comparison wasn't enough and pushed me to write the convoluted ternary comparison function below :

Dlang solution using BFS. Relevant part :

Dlang solution as usual, here's the class that handles monkey business :

Dlang solution. For part 2 I initially thought that the X register contains values exceeding 40, so I kept appending pixels to the CRT while comparing them to the sprite, and in the end I printed the string in chunks of 40. Only later did I realize my mistake

Dlang bruteforce solution. For some reason I thought the rope was 9 knots long and kept getting off by one results. Relevant part 2 portion :

Dlang bruteforce solution

Dlang solution, part 2. I'm embarrassed by this code but I'm sharing it because it took a lot of effort to write it. Previous solutions are available in this repo