In modern day society fields of Artificial Intelligence (AI) and robotics are rapidly growing. One of the most basic elements of them is pathfinding, which enables an agent to calculate a path from a starting point to a target around any number of obstacles.
This work analyzes several pathfinding algorithms and answers if one is the best or if different algorithms are better suited for specific environments and goals. Six algorithms are reviewed: A*, WA*, DWA*, IDA*, JPS, LPA*.