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