Lucky guess of an optimisation for part 1 made part 2 easy.

When brute-force doesn't work for part 1, but you end up getting part 2 for free.

Graph search, that should have been much quicker to implement if I hadn't found a strange issue in a library I was using.