I got a little puzzle for you, you're playing geoguessr except you're allowed to specify a distribution over the entire globe. Now you have N guesses and your objective is to minimize min(distance(target, g) for g in guesses), what is your procedure for going from the distribution to the N guesses with appropriate hedging?
Thought of it while working on this project