This application shows, how to find the optimal path from one point to another with the help of the A* search. In doing so, the type of territory and the enemies moving on a two dimensional map are taken into consideration by calculating way costs for each field. On the picture you find the white point as start and the violet point as the target position. The big red points are visualizing enemies with their range as small red points. The hexagonal fields of the mapped are colored, for showing different types of territory: light green = grass, dark green = wood, blue = water and brown = mountain. Finally the orange points show the best possible solution for reaching the target and avoiding enemies.
It was developed with C++ and the game SDK ClanLib. The source code can be found on GitHub.