MATLAB

Consider N = 2000 walkers, each on a different 10 x 10 square. Each walker can only walk along one of the four nearest neighbors per time steps, and cannot walk back to previously taken steps. Each step is of equal length.

a) For each walker, simulate the program where there is no available site to move to.

b) Using the distance equation, Plot the distance versus time step by two different random walkers.

c) Plot the average value d^2 versus time over all N walkers.

d) Draw a histogram showing the distribution of the total number of steps made by all random walkers.