How can I build an algorithm which creates a random walk but subject to the constraint that I give the initial and final positions.
How can I do it? Let's say I meet a drunk guy on the street. I know from where the guy came and also where we are.
How would I create a possible random path in this setting? (let's simplify to $1$D problem).