The bot uses A* (A-Star) Search. It's smart because it combines three ideas:
G-Cost (from "Graph"):
This is the actual cost of the path from the start node (🚚) to the current node. We just call it the past cost.
H-Cost (from "Heuristic"):
A heuristic is just a smart "guess." This is the estimated cost from the current node to the end node (🏠). We call it the future cost.
F-Cost (from "Final"):
This is the total combined score (G + H). The algorithm always picks the path with the lowest F-Cost to explore next!