This problem was posed to me by Russ Rinehart. He is interested in finding the expected number of iterations that it takes for a stochastic optimization algorithm, called leapfrogging, to stop. A simplified version of the problem can be formally described as follows.