Pretty much what the title says, while trying to route a specific level in a game I run (in short have to destroy 10 targets spread across a large area, no obstacle and no required order) and recalling some Trackmania video talking about it I realized that what would save me a lot of testing and headaches would be a way to bruteforce one of those problems, and since I'm likely not the first one to encounter such a problem I figured someone around here would have encountered a similar issue and would have a solution and / or maybe inspire someone to make a tool for such cases. Even better would be a solver that allows me to pretty much just feed it the map and spit me the shortest path.

tl;dr how2bruteforce traveling salesman problems for dummies