Traveling Salesman Problem... Will this algorithm work? Algorithm: 1) Take a square space and divide it into 4 squares. 2) Find all 94 quadrilaterals that th

Traveling Salesman Problem... Will this algorithm work? Algorithm: 1) Take a square space and divide it into 4 squares. 2) Find all 94 quadrilaterals that the 'nodes' can form. 3) For each quadrilateral, that has points in common with the original, do recursion (I.e. go to step #1 for each of the 94) 4) Keep repeating until some minimal square size (resolution) is reached. Find the path with the shortest 'Error' and that's an approximation to the traveling salesman problem. 'Error' is defined as the sum of the distances of all travel waypoints to the nearest quadrilateral path line.