A* Pathfinding not returning shortest route

General
1

I have a tile-based map and a grid graph. When I am not centred in a tile, A* doesn’t find the shortest route. In the attached image, a 2x2 grid has a yellow X character and a red X destination. The shortest route should be the blue path (as character is part-way to the first node) but A* returns the green path. I’ve fiddled with all the parameters but can’t find a way to get the true shortest route.

2

Hi

The pathfinding system will return the best path to the closest node, it cannot determine it better than that (it is an inherently node based algorithm). If you want to get it with more precision you can increase the resolution (decrease node size) of the graph.

3

Fair enough.