advent-of-code VS aoc

Rust GitHub. My approach is to go through all cuboids and always remove their intersection with all previously added cuboids. Then, If it is a "on" cuboid it is added to the list of cuboids. This way no cuboids will overlap and I can sum all their volumes in the end.

Rust GitHub. Kinda ugly brute force solution which runs in ~10 sec.

Rust GitHub. This took me much longer that I care to admit. I started with a tree-based solution, tried a list, went back to tree and the back to the list again...

Rust GitHub

GitHub.

Rust GitHub. This took a very long time to solve, and the code is not very nice looking.

Full code at GitHub.

Edit: you don't need to determine the type of hand, but you can directly compare the card counts. Second version @GitHub.

New version @GitHub.

So, a new version with a lot less almost-duplicate code @GitHub.

@GitHub

Completed part 2, see GitHub. I couldn't really use the same `DiracDice` class and simply use another `Die`, but had to create a separate `DiracDice2` class.Basically, just keep track of the possible universe state and their counts, and try all possible combinations of die rolls. Keep playing until all universes have a winner.

The rest is the same as my first attempt, but full code at GitHub.

I spent way too much time on this, but I completed my original attempt with the proper object model, see GitHub