adventofcode VS advent-of-code

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.

[LANGUAGE: Python 3] 153/75 Raw solution

One could instead count |F7 (that's what I do in my refactored solution), but counting all the bends would miscount the vertical segments (FJ would end up canceling itself out).

That sounds like what I suggested here, actually. I don't have anything in my library with quite the right API yet, but I already have most of what you describe coded out. (It looks like I whipped it up for 2017 Day 13.)

[LANGUAGE: Python 3] Embarrassing/Embarrassing Ugly raw solution code

[LANGUAGE: Python 3] 66/101 Raw solution code

Python 3 21/12

It doesn't, but you can use a separate list, wrapper classes, and deque.index to find where the values live. I may be biased but I think that my solution (ultimately using deque) isn't as complex as a custom linked list.

Part 2 assumes you did part 1 properly. I did not! I'm pretty sure that the intended solution is to do a sort of reverse search (have a target number of geodes and work backwards to see if that's possible to achieve) but I was just not having success coming up with a way to do that. It's probably going to be blindingly obvious once I figure it out, but that might be an exercise for tomorrow.

Python 3 9/15!!!

Python 3 44/45