advent-of-code VS aoc

My code in Python3 here.

Here is my repo : https://github.com/lehippie/advent-of-code

So, I developed a Python class to manage input parsing and solve day parts. With it, I only have to call the solve() method and he current status or the puzzle is printed to stdout. This helps to avoid regressions when tinkering in part_two with an already solved part_one.

Python3 : https://github.com/lehippie/advent-of-code/blob/master/2021/12.py

Python3 solution

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