I think that is only an estimate. The largest probability for theending point hasthe point which is sqrt(n) away fromthe starting point.

]]>then he will be displaced by sqrt(n)

It could also be possible that there wasn't any displacement at all]]>

The most well known of the random walks is the gambler's ruin problem.

]]>They are connected to Markov chain, which are very useful for certain types of probability questions.

]]>