advent-of-code VS advent

After that, it was a fairly simple loop, nothing too complicated. The full code is here, and the generated raw brainf*ck is alongside it: 975 lines of nonsense. And that's it! My last brainf*ck solution of the year; i didn't expect to be able to solve that many days: 1, 2, 4, 6, 9, 10, and now 25... I've learned a lot, expended my library of macros quite significantly, and now i know what to clean for next year!

I don't have such functions: i have time-travelling hash-maps. :P

full code: https://github.com/nicuveo/advent-of-code/blob/main/2022/haskell/src/Day17.hs

part 1, original, transpiled

code

code on Github

For part 2, i used the transpiler. I duplicate the buffer of 14 cells, sort it using a bubble sort, and then only do 13 comparisons.

As usual, code on Github, recording on Twitch.

No heap allocations: https://github.com/tsenart/advent/blob/master/2023/4

~200 microseconds runtime Go solutions based on BFS that plot the path in the terminal: https://github.com/tsenart/advent/tree/master/2022/12

Also doing it in Go: https://github.com/tsenart/advent

Nice. I did that but traversing all directions in each inner loop iteration: https://github.com/tsenart/advent/blob/master/2022/8/one.go