The scores of the states in the search heap get very low as the search continues, until many of the remaining states have high penalties and low progress, usually from taking the long routes to distant spots. Especially when global actions are available and do not take very long, the branching factor remains quite high. #10 ought to address a handful of these that couldn't possibly finish, but we really ought to just give up at a certain point, maybe when scores are on the order of -2 * max_time?
The scores of the states in the search heap get very low as the search continues, until many of the remaining states have high penalties and low progress, usually from taking the long routes to distant spots. Especially when global actions are available and do not take very long, the branching factor remains quite high. #10 ought to address a handful of these that couldn't possibly finish, but we really ought to just give up at a certain point, maybe when scores are on the order of
-2 * max_time?