advent-of-code-2021 VS adventofcode

https://github.com/fbl100/advent-of-code-2021/blob/master/day_16.py My first attempt at this was really ugly. The second attempt used a buffer that keeps track of the current position, which was much cleaner and resulted in everything just 'falling into place'. I say that until I got the part 2 answer wrong. I had to figure out why a negative number was getting into the mix on my evaluations. Check line 221-223 if you're interested.

Here is my solution: https://github.com/fireduck64/adventofcode/blob/master/2015/07/src/Prob.java

Java 25/38 https://github.com/fireduck64/adventofcode/blob/master/2021/24/src/Prob.java This involved a recursive sweep through the model number space while memoizing on the current register values. Basically, after the model number parts are read they don't matter for the recursion so the only state is the register values and the execution line number. So the memoization was able to actually help. Although, to be honest my solution for part 1 only worked because the number was near where I started the search (9s on down) and the part 2 only worked because I guessed (correctly) that the first number was still a nine because I'm on to how much Eric likes to punish us. Execution time around 2 minutes.