In terms of fast finding of the path, JPS (A*) was the best algorithm in various environments. Its disadvantage is that it found longer path, often longer than the standard 8-connectivity algorithms, e. g. A* algorithm. Therefore, this algorithm is suitable to use in cases where it is necessary to quickly find a path. If the computational time is not significant and length of path is especially important then it is suitable to use Basic Theta* algorithm. This ability of Basic Theta* has been highlighted especially in environments with lower symmetry.