Pathfinding on a hexagonal grid – A* Algorithm
The Knights of Unity
AUGUST 26, 2021
What we usually need is to find the path to the selected point, avoiding all obstacles. It should also be the shortest path, because characters often have limited movement or action points to spend in their turn. . The area around the cat was split into square tiles. We need to somehow compute a value for each considered tile.
Let's personalize your content