Currently, the pathfinding algorithm only looks down one path, in which if it comes across an unwalkable node with the target being an equal Manhattan distance from the current position, it will always prioritise the adjacent walkable cell above, regardless of whether going to the node below having a shorter path.
Currently, the pathfinding algorithm only looks down one path, in which if it comes across an unwalkable node with the target being an equal Manhattan distance from the current position, it will always prioritise the adjacent walkable cell above, regardless of whether going to the node below having a shorter path.