What is the optimal solution of the 1962 Procter and Gamble's TSP Contest?

In 1962, you could win a prize of \$10 000 (about \$ 80 000 in today's money) if you found the solution to an Euclidean travelling salesman problem defined on 33 cities.

http://www.math.uwaterloo.ca/tsp/history/pictorial/car54.html

Looking at the picture, the problem seems pretty easy. However I failed to find more detailed resources on the problem.

Does anybody know some more details, such as the exact distances and an optimal solution?

• Ah, the 1960s... when nobody batted an eyelid at companies advertising their products by showing policemen harassing scantily-clad women. – David Richerby Mar 18 '15 at 11:21