The algorithm scans each hexagon on the map, and if it is free, the data about the hex is placed in an array, the scanning of the map hexes continues until the target hex is reached or the total number of hexagons viewed reaches the limit (for example, 2000) in this case, the path is considered...