jpages on Nostr: Advent of Code - Day 16 Part 1 : 1h33:20 (rank 5030) Part 2 : 1h44:15 (rank 4656) ...
Advent of Code - Day 16
Part 1 : 1h33:20 (rank 5030)
Part 2 : 1h44:15 (rank 4656)
This problem was easier than expected.
For Part 1, I used a recursive algorithm for the beam simulation (whereas many people used BFS), with bitwise operations to accelerate the code. This part executes in 800 µs.
In Part 2, I simply repeated this process for every border tile (440 for the input data), and got my best ranking so far.
#AdventOfCode
Part 1 : 1h33:20 (rank 5030)
Part 2 : 1h44:15 (rank 4656)
This problem was easier than expected.
For Part 1, I used a recursive algorithm for the beam simulation (whereas many people used BFS), with bitwise operations to accelerate the code. This part executes in 800 µs.
In Part 2, I simply repeated this process for every border tile (440 for the input data), and got my best ranking so far.
#AdventOfCode