A relaxed Turing Pattern.
Added "simulated annealing" to the algorithm, the Turing Pattern tends to get stuck in "local minima", it needs to be shaken out of them to find these more optimised patterns.
Using a box blur repeated 5 times to give a good approximation to a gaussian blur
Thanks to Jason Rampe softologyblog.wordpress.com/2011/07/05/multi-scale-turing...
who worked out that box blur is the fastest way of doing the averaging, which simulates diffusion in the reaction-diffusion system.
It's definitely a better method than the ones I have used for a few years now... which had worse time complexity, or similar time complexity but only worked at fixed scales which were powers of an integer.