After the rst plot is completed, begin with the next subplot. Perform a similar algorithm, but plot only where we have been (not how many times we have been there). Set the matrix C to be a matrix of N × N zeros. Let x = N−1 2 and y = N−1 2 . For 10000 iterations, perform the following algorithm: If C(x, y) = 0, change it to 1 and Make (x, y) randomly walk to one of the 8 neighboring values by Randomly changing x by -1, 0 or 1. Randomly changing y similarly (a dierent random change). If the walk attempts to move o of the grid (outside of the bounds of C), then try a random change again. If the walk attempts to go to a location where C(x, y) = 1, try a dierent random change (don't visit somewhere you've been before) If the walk gets stuck (none of the surrounding locations have C(x, y) = 0) then jump to a random location where C(x, y) = 0 and try again