Fair warning, this is probably a hard problem compared to other ones I have shared here before.
Let's consider this a test to see if there is interest in such problems...
Consider a number $x$ between 0 and 1, and the following game:
At each step, define $d$ as:
d = \min(\text{dist}(x, 0), \text{dist}(x, 1))
You then randomly move $x$ to the left or right by a distance $d$. After each move, update the value of $d$ accordingly, and continue until $x$ reaches either 0 or 1.
To clarify:
- At each step, you have a 50% chance of moving $x$ to the nearest endpoint (either 0 or 1).
- You also have a 50% chance of moving $x$ away from the nearest endpoint.
The question is: in terms of $x$, what is the probability that the game ends at 1?
I'll post a hint tomorrow in case I don't see any progress in a reasonable amount of time.
Previous iteration: #712599
f(x)
be the probability that the game ends on 1 when the current position isx
.f(0)=0
,f(0.5)=0.5
andf(1)=1
.0 < x < 0.5
,0.5 < x < 1
,f
is continuous and differentiable (and verify later).0 < x < 0.5
,0.5 < x < 1
,f^\prime(x)
is a constant. And with the boundary conditions off(0)=0
,f(1)=1
, we obtain