$m$ players play a game in which they pick distinctive integers in the range $0:n$ one after another. Then we pick a random integer from $0:n$. Whoever is closest to our pick wins.
What's the optimal strategy for the first player? Is there an algorithmic way to solve this problem other than an exhaustive search?