问题
Please help me finding the shortest path between two points on a 2d grid with obstacles. you will be provide starting coordinates and end cordinates. Also you know where the obstacles are.
回答1:
I suggest A* Pathfinding.
It's a really neat algorithm that should do what you want.
来源:https://stackoverflow.com/questions/23716285/shortest-path-on-a-grid-with-obstacles