Comment by tavianator 1 year ago You may want to look into improvements to A* for grids, like Rectangular Symmetry Reduction. 3 comments tavianator Reply taneq 1 year ago Also jump point search: https://zerowidth.com/2013/a-visual-explanation-of-jump-poin... dietr1ch 1 year 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 1 year ago afaik jump point search would work for uniform cost grids but not if there's the exponential term that OP has
taneq 1 year ago Also jump point search: https://zerowidth.com/2013/a-visual-explanation-of-jump-poin... dietr1ch 1 year 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 1 year ago afaik jump point search would work for uniform cost grids but not if there's the exponential term that OP has
dietr1ch 1 year 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 1 year ago afaik jump point search would work for uniform cost grids but not if there's the exponential term that OP has
Also jump point search: https://zerowidth.com/2013/a-visual-explanation-of-jump-poin...
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