neilnjae, 4 months ago #AdventOfCode day 25 done in #Haskell I decided to use a probabilistic approach. I pick 200 random pairs of nodes and find the paths between them. About half those paths use the cut-set edges, so those three edges will be used more than the others. That's enough to identity the cut-set. Full writeup: https://work.njae.me.uk/2024/01/06/advent-of-code-2023-day-25/ Code: https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent25/Main.hs #AdventOfCode2023 #AoC2023
#AdventOfCode day 25 done in #Haskell
I decided to use a probabilistic approach. I pick 200 random pairs of nodes and find the paths between them. About half those paths use the cut-set edges, so those three edges will be used more than the others. That's enough to identity the cut-set.
Full writeup: https://work.njae.me.uk/2024/01/06/advent-of-code-2023-day-25/
Code: https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent25/Main.hs
#AdventOfCode2023 #AoC2023
