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
jpages /
npub1mr…ek4s2
2023-12-28 03:27:49
Author Public Key
npub1mr0wam5le7yta87mshdg2jrflgv9t0fq6gl4gkvaejw54k6z78gq9ek4s2Published at
2023-12-28 03:27:49Event JSON
{
"id": "59bb9d6b0ff02162ba302d4beac4fd66bfdc8f242f196df5d724cbd3427b2d5e",
"pubkey": "d8deeeee9fcf88be9fdb85da854869fa1855bd20d23f54599dcc9d4adb42f1d0",
"created_at": 1703734069,
"kind": 1,
"tags": [
[
"t",
"adventofcode"
]
],
"content": "Advent of Code - Day 25 \n\nPart 1 : \u003e 24 h (rank 10741)\nPart 2 : \u003e 24 h (rank 7862)\n\nThe 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.\n\nI 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.\n\n#AdventOfCode",
"sig": "33b1356818a95f6cd846ed3f29adba919af72d4ee6e096679cae43431b73f50bbedb7b741fd51f29f36b3d92ef5c612f258864ee9ce55f8c099fa55ac472bd10"
}