Question 161
Let $S$ be a set of 16 points in the plane, no three collinear. Let $\chi(S)$ denote the number of ways to draw 8 line segments with endpoints in $S$, such that no two drawn segments intersect, even at endpoints. Find the smallest possible value of $\chi(S)$ across all such $S$.