A * pathfinder algorithm experiments on a (for the time being) preset maze

maze & start & end points:

In games we often want to find paths from one location to another. We’re not only trying to find the shortest distance; we also want to take into account travel time.

• Breadth First Search explores equally in all directions. This is an incredibly useful algorithm, not only for regular path finding, but also for procedural map generation, flow field pathfinding, distance maps, and other types of map analysis.

• Dijkstra’s Algorithm (also called Uniform Cost Search) lets us prioritize which paths to explore. Instead of exploring all possible paths equally, it favors lower cost paths. We can assign lower costs to encourage moving on roads, higher costs to avoid forests, higher costs to discourage going near enemies, and more. When movement costs vary, we use this instead of Breadth First Search.

• A* is a modification of Dijkstra’s Algorithm that is optimized for a single destination. Dijkstra’s Algorithm can find paths to all locations; A* finds paths to one location. It prioritizes paths that seem to be leading closer to the goal.

• create random maps with a function: DONE ✌️ 🎲🎲🎲

• use other distance metrics in the algorithm?

• integrate MAZEBOT API :

  • get a maze from the api DONE ✌️
  • solve the maze DONE ✌️ (this is what the algorithm does!)
  • return the solution through the API? ISSUE with a [hacktoberfest] label

• use a graphics library to visualise everything in 3d: TODO 😱