With a great lack of industriousness and an excess of curiosity I decided to implement a random walk algorithm.
This algorithm, specifically called diffusion limited aggregation, places a "seed" somewhere on an N x N matrix, typically the center. Next a "particle" is placed on a random edge of the matrix and allowed to "diffuse" about. Once the particle is immediately adjacent to the seed it "sticks". This process is repeated for as many particles as you like where a particle only sticks if it is next to another particle that is already stuck. To the left is the result. For more info go here.
