A\* Search Algorithm
A star algorithm
A* search is an informed graph traversal and pathfinding algorithm. It efficiently finds the least-cost path from a starting node to a goal node by combining the cost of reaching a node (g-score) with a heuristic estimate of the cost to reach the goal from that node (h-score). The 'f-score' (f = g + h) is used to prioritize nodes, guiding the search towards promising paths often significantly reducing computational effort compared to uninformed methods like breadth-first or depth-first search.
9 connections Built by Tim Jones