44. On the Euclidean plane are given 14 points:
$$
\begin{array}{l}
A=(0,428) \quad B=(9,85) \quad C=(42,865) \quad D=(192,875) \\
E=(193,219) \quad F=(204,108) \quad G=(292,219) \quad H=(316,378) \\
I=(375,688) \quad J=(597,498) \quad K=(679,766) \quad L=(739,641) \\
M=(772,307) \quad N=(793,0) \\
\end{array}
$$

A fly starts at $A$, visits all the other points, and comes back to $A$ in such a way as to minimize the total distance covered. What path did the fly take? Give the names of the points it visits in order. Your score will be
$$
20+\lfloor\text { the optimal distance }\rfloor-\lfloor\text { your distance }\rfloor
$$
or 0 , whichever is greater.
Answer: The optimal path is $A C D I K L J M N H G E F B(A)$, or the reverse, of course. In this way the total distance covered by the fly is just over 3591.22.
Solution: This problem is an instance of the Traveling Salesman Problem, which is NP-hard. There is an obvious algorithm in $O(n!)$ time (where $n$ is the number of points), but faster algorithms exist. Nonetheless, the best strategy for solving this problem is probably to draw the points and exercise your geometric intuition.