Hi all,
I've encountered this problem:
============================================================================================
There are 100 equally spaced points around a circle. At 99 of the points, there are sheep, and at 1 point, there is a wolf. At each time step, the wolf randomly moves either clockwise or counterclockwise by 1 point. If there is a sheep at that point, he eats it. The sheep don't move. What is the probability that the sheep who is initially opposite the wolf is the last one remaining?
============================================================================================
This problem is more or less like the gambler ruin problem, but I can not think of a proper way to come up a recursive formula for it. Very appreciate for help.
Thanks.
I've encountered this problem:
============================================================================================
There are 100 equally spaced points around a circle. At 99 of the points, there are sheep, and at 1 point, there is a wolf. At each time step, the wolf randomly moves either clockwise or counterclockwise by 1 point. If there is a sheep at that point, he eats it. The sheep don't move. What is the probability that the sheep who is initially opposite the wolf is the last one remaining?
============================================================================================
This problem is more or less like the gambler ruin problem, but I can not think of a proper way to come up a recursive formula for it. Very appreciate for help.
Thanks.