AdventOfCode2022 VS AdventOfCode

For part 2 it was just a matter of adding recursion to go back and forth in the map, switching starting position and target each time: https://github.com/Convez/AdventOfCode2022/blob/main/day24/src/main.rs

Better late then never. Each round I generate a treemap that holds the elves for a proposed position. For part 2 I set the target round to the max usize and break when the treemap is empty. https://github.com/Convez/AdventOfCode2022/blob/main/day23/src/main.rs I'm sure the update of the elf position can be optimized more, but I'm already late for day 24 :D

I think the cycle detection is ok, since I verify that the pattern I found is repeating. So it's either something wrong with the cycle detection or with my math at the end. Could someone help me? https://github.com/Convez/AdventOfCode2022/blob/main/day17/src/main.rs

This solution works on the test data, but for actual data it's giving me a higher number. My function is trying to find the highest possible score, and at each recursive level I remove the current item to the eligible nodes, I'm not sure if there is something wrong with my exit condition or my score calculation: https://github.com/Convez/AdventOfCode2022/blob/main/day16/src/main.rs

Code: main (445b314)

Edit: Made some of those improvements. Have a look at main. Want the original code? Check out commit c6ae21b

Code: main (de0beb6)

Code: main (5f0a9a8)

For part 1 my sneaky elves took a step north and then walked around the outside of the blizzard field. I trapped them in with additional walls \evil grin**

Python [762/731]

Python+Paper [1740/765]

Python+sympy [204/1353]

Python [213/499]

Version at time of posting: 492376c (since I've committed since then)