This code intricately simulates the diffusion-limited aggregation cellular automaton, a complex system based on the RWCA model [1,2,3]. It uses GSL for the random number generator and EGGX for graphics.
The updated rules are as follows.
-
Each walker embarks on a fascinating journey of random steps across the 2D lattice, guided by the RWCA rule. Meanwhile, a seed walker remains at the center site, a steadfast point in the ever-changing landscape.
-
When a walker comes into contact with the seed walker, it also becomes a part of the seed walker and does not move anymore.
To compile the code, type 'make' in the program directory.
This is a snapshot of the system. Green dots represent moving walkers, while the walkers captured by the seed are colored differently depending on the CA time steps taken when they were captured.
[1] Cellular automaton model for random walkers
[2] Cellular automaton model for biased diffusive traffic flow