This chain is called a random walk, and is used to describe the walk of a sufficiently intoxicated person: if he is at position i after step n, his next step leads him to either i + 1 or i − 1 with respective probabilities p and q except that at i = 0 there is a barrier and when he hits it he is sure to step back to 1.
