![]() |
Voter Model Each pixel looks at its 8 neighbours and takes on the colour of the majority, or if there is a tie, flips a coin.
|
|
Oriented Percolation Take a 2-d grid and rotate it 45 degrees. Now imagine the lines are pipes that could carry water. There is a certain probability that a pipe is blocked and won't let water pass through. This is where there are black areas. Now take several different colours of water at random and pour them into the pipes. |
|
Oriented Percolation: A Variant This time, when two colours duel for a position, instead of the fittest survives, the rule says that there is a chance of conception of a new colour, based on the colours of each parent.
|
| Stepping Stone |
|
Parity Rule Probably the simplest CA to code up, this one I did more as a test for my on-the-fly mpeg encoder. Each pixel looks N, S, E, W and turns on or off based on the rule ((N+S+E+W) mod 2) where N,S,E,W are boolean. |
|
|