Depends on Dijkstra Pathfinding for Title Based Game.
Create an implementation of the A* algorithm that works on a bidimensional map.
The same code written on the Dijkstra implementation can be reused here, but we need take an heuristic into consideration.
Depends on Dijkstra Pathfinding for Title Based Game.
Create an implementation of the A* algorithm that works on a bidimensional map.
The same code written on the Dijkstra implementation can be reused here, but we need take an heuristic into consideration.