Problem of the day
Let \(\mathcal{T}\) be the isosceles triangle with side lengths \(5, 5, 6\). Arpit and Katherine simultaneously choose points \(A\) and \(K\) within this triangle, and compute \(d(A, K)\), the squared distance between the two points. Suppose that Arpit chooses a random point \(A\) within \(\mathcal{T}\). Katherine plays the (possibly randomized) strategy which, given Arpit's strategy, minimizes the expected value of \(d(A, K)\). Compute this value.