This update must proceed simultaneously . On a serial computer this parallelism is simulated by storing the updates of every cell in a buffer-memory. Only when all updates are computed they are actually assigned to the cells. For one-dimensional systems the trick with the buffer is not necessary, because in that case we simply place the updated cells below the original cells. We accordingly obtain a space-time pattern consisting of successive rows of cells of which every row is an update of the preceding one.
back to main text