AoC_Collection VS advent-of-code-wim

Not sure if my solution counts as a tree, but I expect to need the "filesystem" logic in the future, so I overengineered it.

Java GitHub

Thanks for the extra example. I've added it to my CI and test suite in https://github.com/wimglenn/advent-of-code-wim/pull/89

Full code here

I'm using Python so I'll never be as fast as the people using Rust or C, but am still able to solve most puzzles in under 1 second (repo: https://github.com/wimglenn/advent-of-code-wim).

Thanks for the kind words, well the source is here so you can just take a look. You have to run with var AOC_DEBUG=1 in env to enable the rendering.

I used an AStar pathfinder already prepared from earlier years (aoc2022/q12.py), just leaving the default null heuristic. If I understand correctly that is just a BFS.

https://github.com/wimglenn/advent-of-code-wim/blob/main/aoc_wim/ocr.py has nearly all the letters we've seen (including a larger font used once in 2018) although it is missing the 5-wide Y that was in my 2016-day 08 puzzle

By the way, I found that if you're willing to use pathlib and a guard, you actually only need 2 of those 6 case statements - it looks like this.

Python (repo). I was particularly pleased with how quick the parsing was.

Python + "AOCR" + complex numbers.

Python