← Back to context Comment by taneq 1 day ago Also jump point search: https://zerowidth.com/2013/a-visual-explanation-of-jump-poin... 2 comments taneq Reply dietr1ch 1 day ago If just use A*, but you rank open to loop for lowest (f, h) pairs, then the search frontier just dives despite having multiple optimal paths, as the new node tie-breaking ensures we prefer nodes that seem closest to the goal. porphyra 9 hours ago afaik jump point search would work for uniform cost grids but not if there's the exponential term that OP has
dietr1ch 1 day ago If just use A*, but you rank open to loop for lowest (f, h) pairs, then the search frontier just dives despite having multiple optimal paths, as the new node tie-breaking ensures we prefer nodes that seem closest to the goal.
porphyra 9 hours ago afaik jump point search would work for uniform cost grids but not if there's the exponential term that OP has
If just use A*, but you rank open to loop for lowest (f, h) pairs, then the search frontier just dives despite having multiple optimal paths, as the new node tie-breaking ensures we prefer nodes that seem closest to the goal.
afaik jump point search would work for uniform cost grids but not if there's the exponential term that OP has