I tried to implement A* algorithm in Blender. This algorithme finds the best path (not all the time) from one point to another in a labyrinthe.
I share the result of my experience:
With the mouse:
- right click to change destination (warning: if the path is too complicated, Blender can crash). if no path is found, a message “pas de solution” is written in console.
- left click to add an obstacle
- wheel click to delete an obstacle
- mouse wheel to change obstacle(obsx=horizontal obstacle, obsy=vertical obstacle)
Another implementations of A* for Blender here:
And here is an illustration of the way of functioning of the algorithme:
Thanks for any comment, way to make the implementation faster…
Have a good day!
Jump Point Search:
Jump Point Search simple: