订阅以下载
Ultimate Path Finder

Add nodes with the tools by left-clicking. Press 'c' to compute the shortest path. Press 'x' to erase all nodes. Press 'v' to switch between the fast and slow computation mods. You position when you press 'c' will be the ending position.

This mod aims at solving the famous Travelling Salesman Problem (TSP) that we are facing in Teardown.

It is implemented using a Genetic Algorithm (Metaheuristic).

Both mods are available:
- Fast computation, ignoring walls.
- Slow computation, taking into account walls but might be longer to execute (or even won't find a solution).

Just press 'c' after placing the nodes and it wil start computing. You can do whatever you want during the computing. During the second step of the computation it will lag during some seconds but it is normal.

It is possible to modify some parameters in the options.

Disclaimer: Of course the purpose of this is not to cheat the campaign, but it was only a fun challenge to do on my side. Please do not cheat in the campaign before clearing the level by yourself first.