A* Map System

Wed, 20 Jan 2021 00:00:00 +0000

Contracted to make a Custom A* Map System.

The client requested a Custom Hex Tile Map System that had Methods to calculate the best path to take. It needed to be modular and flexible with any map size, and calculate pathing using an asynchronous pattern.

The A* Algorithm

The A* (pronounced “A-star”) algorithm is a powerful pathfinding technique used in various fields of computer science. It offers completeness, optimality, and optimal efficiency.

A* is a graph traversal and pathfinding algorithm.
Given a weighted graph, a source node, and a goal node, A* finds the shortest path (with respect to the given weights) from the source to the goal.
It evaluates points using a heuristic value (also known as the H score), which estimates the distance from a node to the goal.
A* combines both the movement cost (from the current point to its neighbors) and the heuristic value to guide its search.

It even came with a Custom Editor Tool I made to help simulate the pathing in and outside of PlayMode.

A* | Dencho

A* Map System

The A* Algorithm