Brute Force is a problem solving mechanism that takes into account all the possible solutions to the existing problem and then finalizing the most efficient problem.
It does not take into account any special algorithm which can eliminate a few options tactfully. No shortcuts are taken to reach to the optimal solution.
In case of travelling sales man problem, the brute force programming will find the distance travelled through all the possible paths.
After doing so it will then display the one with least distance. It will not use additional programs to cut short a few paths which do not come into the shortest paths.