The ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. Artificial ants stand for multi-agent methods inspired by the behavior of real ants. It helps to solve various tasks, including vehicle routing, internet routing [Wiki].
Finding an optimal path with brute force on the other hand would require a lot of computer power: (n-1)!/2 variant to compare, where n is the number of agents. For 15 points it would require to compare 43,589,145,600 paths.
With this plugin will be able to find the route for the same amount of points without notice.
Number of Blueprints: 1
Number of C++ Classes: 6
Network Replicated: No
Supported Platforms: Win64
Example Project: 4.26
Notes: This plugin has its limits on the size of the path it can solve. It was tested for 15 points with stable results.