Finding a set of points in a unit square such that the length of the optimal TSP tour is longest possible was first mentioned in the 1940s. The asymptotics were established in the 1980s, but the actual solution of the problem for a given number of points is still an open question. In this talk we will give a background of the problem, show some bounding techniques and establish new point configurations, some of which are provably optimal.