is a computer algorithm in AI that is extensively used for the purpose of finding paths or traversing graphs – to obtain the most optimal route between nodes. It is widely used in solving pathfinding problems in video games. Considering its flexibility and versatility, it can be used in a wide range of contexts. A* is formulated with weighted graphs, which means it can find the best path involving the smallest cost in terms of distance and time. This makes A* an informed search algorithm for best-first search.