Problem:
A parking lot consists of 2012 parking spots equally spaced in a line, numbered 1 through 2012. One by one, 2012 cars park in these spots under the following procedure: the first car picks from the 2012 spots uniformly randomly, and each following car picks uniformly randomly among all possible choices which maximize the minimal distance from an already parked car. What is the probability that the last car to park must choose spot 1?
Solution
Solution:
We see that for 1 to be the last spot, 2 must be picked first (with probability ), after which spot is picked. Then, cars from 3 to will be picked until there are only gaps of 1 or 2 remaining. At this point, each of the remaining spots (including spot 1) is picked uniformly at random, so the probability that spot 1 is chosen last here will be the reciprocal of the number of remaining slots.
Let denote the number of empty spots that will be left if cars park in consecutive spots whose ends are occupied, under the same conditions, except that the process stops when a car is forced to park immediately next to a car. We want to find the value of . Given the gap of cars, after placing a car, there are gaps of and remaining. Thus, . With the base cases , , we can determine with induction that
Thus, , so the total probability is .