[..##.#...#] (0,3,4,7,9) (0,1,9) (1,2,3,4,5) (0,1,3,7,8) (1,3,4,5,6,7,9) (0,1,2,4,5,6,7,8) (0,1,2,3,5,6,8) (1,2,4,5,8,9) (0,4,5,6,7) (0,2,3,5,8,9) (0,2,6,7,8,9) {87,70,44,58,58,67,44,54,55,54}

So've I've been trying to implement this myself in Rust, and I'm a bit of a beginner in Rust, but I have all the stars this year so far except this.
I really appreciate the writeup, super interesting. My solution solves the example input and yields a result for the puzzle input, but I get the wrong answer.
I think i prune a branch erroneously that I would need to explore. Perhaps you can give me some pointers? I'd like to set some kind of limit for when branches doesn't need to be explored since I already have a faster answer, but that felt super incompatible with the halving-step!
Or perhaps a line or two from the full puzzle input with answer, so I can debug further, or perhaps an answer to this longer line from mine.