Consider a toy problem, of a train moving along a 1D track in the x-direction. Suppose that the train moves either a distance of + b or − b (b is the same for each step), depending on whether a coin lands heads or tails when flipped. Lets start by considering the statistics of the steps the toy train takes (where S i is the ith step taken):