aoc2022 VS AdventOfCode

I also checked lines but only after doing a rotation by 45 degrees, so the lines are straight. Compiled in C, fastest run time on M1 was 26 µs: https://github.com/ednl/aoc2022/blob/main/15.c

Not sure if anybody already did this, but I used an integer rotation of 45 degrees to the left to check for the gap of 1 between sensor ranges and then rotated back to the right. Both rotations also multiply everything by a factor of sqrt(2) (for a pure rotation you would divide by that factor but fractional grid coordinates are no good), so to go back to original coordinates you need to divide by 2 in the end. This made the search pretty straightforward. Runs in 26 µs on Apple M1 and 126 µs on Raspberry Pi 4. See at the top of my source code for how I measured that.

Same code but with preprocessed input to make it all fit into memory, runs in 7 ms on an Arduino Uno! https://github.com/ednl/aoc2022/blob/main/aoc22-15/aoc22-15.ino

Complete program runs in 463 µs on Apple M1, 2.61 ms on Pi 4. See comments at the top of the source file for how I measured. My comparison function:

Full source code Straightforward BFS with a simple own implementation of a queue. Only clever bit was to simply use End as the start position for part 2 and change the finish condition:

Not 100% sure this is Upping-The-Ante, maybe just Other. I wanted to share some benchmark results of my solution for today, day 11 with the 10,000 monkeys, and how I got there. I think the easiest way to compare performance is to use the same hardware, and nowadays fairly common & standardised hardware might be the Raspberry Pi 4. Although, you can't buy any for years now... Best score I got when running my solution on my Pi 4 home server is 15.6 ms.

I quickly saw that I could do "item = item modulo (product of all div-test numbers)" but the implementation took me a while in C without queues or circular buffers. But that's all part of the fun for me! I didn't look for further clever optimisations because the compiled program runs in 20 ms on a Raspberry Pi 4. That was fast enough for today, I thought. Source code: https://github.com/ednl/aoc2022/blob/main/11.c

Yay, embedded software engineering!! :) Short, fast & almost no memory needed in C: https://github.com/ednl/aoc2022/blob/main/10.c or the relevant bits:

It took me very long in part 2 to realise that I had to take one step at a time for every knot. I had built it to move Head all the way, then move Knot1 all the way to Head, then move Knot2 all the way to Knot1, etc. That this was wrong WAS visible in the result of example 2, but my method gave the same answer 36 and it had only ONE different visited location on the whole grid, which I totally missed. Gah. Source: https://github.com/ednl/aoc2022/blob/main/09.c

[LANGUAGE: Python 3] 20/50. Solution. Video.

Python3, 90/55. Video coming soon. Code.

Python3, 5/5. Video. Code. I'm now in second place overall!

C++, 41/412. Video. Code. My C++ code runs in about 70 seconds (for both parts).

Python3, 31/31. Video. Code.

Python3, 75/41. Wrote my BFS from scratch! Video coming soon. Code.

Python3, 353/412. Video on its way; I had some recording issues today. Code.

Python3, 9/4! Video. Code. I'm happy to make the top 10!

Python3 19/24. Video. Code. Quick one today!

Python3 116/50. Video. Code. Got a wrong answer on part1 :(