3

I am currently studying pathfinding and I came across A* algorithm from this site https://github.com/qiao/PathFinding.js

I tried to test A* with bi-directional and it is working great.

An a* path

What I wanna do now is increase the path that it can make without adding more nodes in the openlist.

For example is that the algorithm was able to find a path but as you look at the results it can still generate one more path without touching the other path.

two distinct paths

Any ideas?

Macross
  • 41

1 Answers1

5

For finding

one more path without touching the other path

just remove the squares of the first path (except the start and ending square) from the map and run A* again.

Doc Brown
  • 218,378