Pathfinding 2D AI example. Based on A* (BFS, Wave, Width) algorithm.
Pathfinding 2D AI example. Based on Lee-Wave algorithm (A*, BFS, Width).
1) Data loaded from file.
2) Map printed to the console-output as chars ;
3) path finding ;
4) if path not found, message printed, if it is founded, map with route printed. Each step of the route
have its own number (step-index). Available option is to find route with longest length ;
Only C++ 11 with a few includes.
Map data stored in file, where also start & finish are set.
Made with VSCode C++.
[1.0]
[1.1]