Hello, I have been working on A star pathfinding algoritham, and I’ve got it working for the most part but I was wondering if anyone could give me any advice as to what to do when I am faced with 2 or more paths that have the same movement cost, I was thinking of just picking one of the paths (that are of equal length) at random, but is there a quicker to do this?
I have included an image below, if the player was the red square and the goal was the green square, you can see there are two paths the player could take.
