"
Team:CAU China/Modeling
From 2014.igem.org
| Line 16: | Line 16: | ||
<td width="45%" valign="top"> | <td width="45%" valign="top"> | ||
| - | <p style="text-align: left">A growing snowflake can be programmed with two-dimensional cellular automaton[]. The cellular space is defined as a two - dimensional square lattice of cells with size of n*n. Every cell has two states, on and off, represented by “1” or “0” respectively, and has four orthogonally adjacent cells as neighborhood. Its evolution rule directs how cells change states from one discrete time point to the next and it is that: if a cell is off, it can change state to be on at the next time point only when one out of its four neighborhood is on; if a cell is on, it will remain on forever. | + | <p style="text-align: left; color=#FFFFFF;">A growing snowflake can be programmed with two-dimensional cellular automaton[]. The cellular space is defined as a two - dimensional square lattice of cells with size of n*n. Every cell has two states, on and off, represented by “1” or “0” respectively, and has four orthogonally adjacent cells as neighborhood. Its evolution rule directs how cells change states from one discrete time point to the next and it is that: if a cell is off, it can change state to be on at the next time point only when one out of its four neighborhood is on; if a cell is on, it will remain on forever. |
</p> | </p> | ||
| - | <p style="text-align: left"> | + | <p style="text-align: left; color=#FFFFFF;"> |
For a cell with coordination of , at time point , its state can be shown as. Then the evolution rule is: | For a cell with coordination of , at time point , its state can be shown as. Then the evolution rule is: | ||
</p> | </p> | ||
| Line 27: | Line 27: | ||
</p> | </p> | ||
| - | <p style="text-align: left"> | + | <p style="text-align: left; color=#FFFFFF;"> |
Let initial state as all cells off except for the center four “on” cells. As time increases, a growing snowflake forms with less than 10 steps (one step equals to one time point). Figure 1 shows how a snowflake grows up at time point 6. Figure 2 shows a dynamic pattern of it. | Let initial state as all cells off except for the center four “on” cells. As time increases, a growing snowflake forms with less than 10 steps (one step equals to one time point). Figure 1 shows how a snowflake grows up at time point 6. Figure 2 shows a dynamic pattern of it. | ||
</p> | </p> | ||
| - | <p style="text-align: center;"> | + | <p style="text-align: center; color=#FFFFFF;"> |
<img src="https://static.igem.org/mediawiki/2014/f/f6/CAU_Model2.png"> | <img src="https://static.igem.org/mediawiki/2014/f/f6/CAU_Model2.png"> | ||
<br> | <br> | ||
Revision as of 00:40, 18 October 2014
Form a growing snowflake with Cellular Automaton
A growing snowflake can be programmed with two-dimensional cellular automaton[]. The cellular space is defined as a two - dimensional square lattice of cells with size of n*n. Every cell has two states, on and off, represented by “1” or “0” respectively, and has four orthogonally adjacent cells as neighborhood. Its evolution rule directs how cells change states from one discrete time point to the next and it is that: if a cell is off, it can change state to be on at the next time point only when one out of its four neighborhood is on; if a cell is on, it will remain on forever.
For a cell with coordination of , at time point , its state can be shown as. Then the evolution rule is:
Let initial state as all cells off except for the center four “on” cells. As time increases, a growing snowflake forms with less than 10 steps (one step equals to one time point). Figure 1 shows how a snowflake grows up at time point 6. Figure 2 shows a dynamic pattern of it.
Figure 1
Figure 2
