Click on the green flag. Patience.i This project is a simulation, an experiment, of a random walk on the integer number line. It takes approximately 22 minutes to complete the experiment. The random walker performs 100 trials of successive random walks of 0–10 steps. At the end of each walk the square of the distance from 0 is accumulated and at the end of 100 walks the average is computed. This value, the average square displacement, is stored in a list. At the end of each of the 100 trials the ASD is plotted. Note that the data falls along a line. Let d^2 = ASD then d^2 = n where n is the number of steps in the walk. Therefore d = √(n) A proof of this can be found in: The Feynman Lectures on Physics Volume 1, Chapter 6, Probability Richard Feynman California Institute of Technology
My related 'One-dimensional' Random Walk Scratch projects: The Galton Board (Quincunx) https://scratch.mit.edu/projects/92200985/ Random Walk on the Integer Number line Probabilities https://scratch.mit.edu/projects/86951083/ Feynman's Random Walk https://scratch.mit.edu/projects/11282377/ Random Walk Paradox https://scratch.mit.edu/projects/108902059/ The Huckster's Game https://scratch.mit.edu/projects/68836046/ Random Walk with Barriers https://scratch.mit.edu/projects/11300964/
