jpages on Nostr: Advent of Code - Day 25 Part 1 : > 24 h (rank 10741) Part 2 : > 24 h (rank 7862) The ...
Advent of Code - Day 25
Part 1 : > 24 h (rank 10741)
Part 2 : > 24 h (rank 7862)
The final problem was much harder (for me) than expected, and I could not figure out a decent algorithm to solve it within 24 hours, even if I tried very hard.
I finally solved it a few hours ago, with a statistical method. I computed the shortest paths from 500 nodes, and I counted how many times edges were included in the paths. Then, I tested in priority the most represented edges.
#AdventOfCode
Part 1 : > 24 h (rank 10741)
Part 2 : > 24 h (rank 7862)
The final problem was much harder (for me) than expected, and I could not figure out a decent algorithm to solve it within 24 hours, even if I tried very hard.
I finally solved it a few hours ago, with a statistical method. I computed the shortest paths from 500 nodes, and I counted how many times edges were included in the paths. Then, I tested in priority the most represented edges.
#AdventOfCode