Well, imagine a planning algorithm that has no memory—then a heuristic like that (maybe with some amount of randomness to avoid cycles and such) might be your best bet.
Well, imagine a planning algorithm that has no memory—then a heuristic like that (maybe with some amount of randomness to avoid cycles and such) might be your best bet.