vidi-plates
 


cellular_automaton_i

"a low-fi quasi-single-rotation-cellular-automaton with a bit Conway's game of life too."

I came across, what I think, is a very interesting cellular automaton by Dmitry Shintyakov: http://dmishin.blogspot.co.uk/2014/12/single-rotation-rule-with-frame.html.

I've always really liked cellular automata but the ones I've looked at always tended to settle into a boring/ repetitive state pretty quickly. When I saw Dmitry's single-rotation-rule-cellular-automaton I thought it looked great and stayed interesting for a real long time. I thought I'd create my own version and have a play to see if I could create something with 'long-term interest'.

I have only just realised, because I can't find any reference to it on the web, that the single-rotation-rule-cellular-automaton was actually discovered by Dmitry, so big props to him.

In an attempt to prolong interest cellular_automaton_i consists of two sets of agents which follow the single-rotation-rule within their own set but also interact with agents from the other set using a variation of the Conway's game of life rules. Oh yeah, and I've added a couple a daemon agents as a final guard against a stable state.

- created in 2015




view


 > the rules < 

 setup 

  • a number of  red  and  blue  cells are added randomly to a grid
  • a  green  cell is added near the bottom of the grid
  • a  yellow  cell is added near the top of the grid
 every turn (movement) 
  • the grid is divided into smaller grids of 2 x 2 cells
  • then for each 2 x 2 grid
    • if the total number of  red  cells is 1 then that  red  cell is rotated anti-clockwise by one around the 2 x 2 grid
    • if the total number of  blue  cells is 1 then that  blue  cell is rotated anti-clockwise by one around the 2 x 2 grid
  • now all the 2 x 2 grids are shifted one cell right and one cell down ready for the next turn
 every turn (reproduction) 
  • the 8 adjacent cells of each  red  cell is counted.
    • If there is 1  blue  cell and 0  red  cells a new  red  cell is added at the  blue  cell's position.
  • the 8 adjacent cells of each  blue  cell is counted.
    • If there is 1  red  cell and 0  blue  cells a new  blue  cell is added at the  red  cell's position.
 every turn (overcrowding) 
  • the 8 adjacent cells of each  red  cell is counted.
    • If the total number of  blue  cells (minus 1) is greater than the total number of  red  cells that  red  cell is removed.
  • the 8 adjacent cells of each  blue  cell is counted.
    • If the total number of  red  cells (minus 1) is greater than the total number of  blue  cells that  blue  cell is removed.
 every 12 turns 
  • the  green  cell moves forward 1 cell, if it lands on a  red  or  blue  cell that cell is removed and the  green  cell turns anti-clockwise.
  • the  yellow  cell moves forward 1 cell, if it lands on a  red  or  blue  cell a cell of that colour is added to the  yellow  's cell previous position and the  yellow  cell turns anti-clockwise.



view





All content owned by Mitchell William Cooper.
my non-art things can be found @ www.forkandbeard.co.uk | google+ | twitter

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License and is not to be displayed publically without permission.

Creative Commons Licence