Not sure if you ever got this figured out. If still interested I would just suggest that rather than taking the shortest path for each valve to the head of the last path, you need to search from the head of the last path to each valve. And then your recursion is from the head of that resulting path to the remaining valves with a terminal condition of either time running out or all valves being used.
stevensonmt
tfwright
Thanks, yeah once I accepted that the only way to solve was search the whole path tree I was able to get part 1. Had to give up at part 2 though due to lack of time. Looking forward to trying again next year.
0