Hi guys,
I’m trying to make an A* pathfinding system based on a grid.
it’s been litterally 2 days I can’t find the solution to my problem.
The path returning don’t go through the fastest path and I can’'t Figure why
If someone have any ideas ?
we’d need to see your code but this is a great reference to help you
I found the solution. I’ll try to explain if anybody got the same problem. I had to change the function that detects neighbours of the analyzed square.
I had to make it so it prefer to move forward than in diagonals if the two tiles has the same cost.