使用一维数组实现规则 110 元胞自动机

Question

我正在尝试编写代码以使用一维数组显示规则 110，对于 30 个整数的数组，20 行。

#include <stdio.h>

void rule(int t[]);

int main(void)
{
int count = 0;
int i;
int t[] = {0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0};
while (count++ < 20)
{
    for (i = 0; i < 30; i++)
    {
        rule(t);
        printf("%d", *t);
    }
    printf("\n");
}
return 0;
}

void rule(int t[])
{

int t1[30];
int ix;
int i;
for (ix=0; ix < 30; ix++)
    {
    if ((t[ix-1] == 0) && (t[ix] == 0) && (t[ix+1] == 0))
        {
        t1[ix] = 0;
        }
        else if ((t[ix-1] == 0) && (t[ix] == 0) && (t[ix+1] == 1))
        {
        t1[ix] = 1; 
        }
        else if ((t[ix-1] == 0) && (t[ix] == 1) && (t[ix+1] == 0))
        {
        t1[ix] = 1;
        }
        else if ((t[ix-1] == 0) && (t[ix] == 1) && (t[ix+1] == 1))
        {
        t1[ix] = 1;
        }
        else if ((t[ix-1] == 1) && (t[ix] == 0) && (t[ix+1] == 0))
        {
        t1[ix] = 0;
        }
        else if ((t[ix-1] == 1) && (t[ix] == 0) && (t[ix+1] == 1))
        {
        t1[ix] = 1;
        }
        else if ((t[ix-1] == 1) && (t[ix] == 1) && (t[ix+1] == 0))
        {
        t1[ix] = 1;
        }
        else if ((t[ix-1] == 1) && (t[ix] == 1) && (t[ix+1] == 1))
        {
        t1[ix] = 0;
        }
    }
    for (i = 0; i < 30; i++)
        {
        t[ix] = t1[ix];
        }


}

它创建了一个大小为 30 的数组，其中主要填充了 0 和几个 1，然后在规则函数中创建了一个新数组并根据先前数组包含的内容对其进行填充，然后将其复制到初始数组中，然后这被传递回 main。但是我的似乎只打印了很多 0。

它应该看起来像：

其中0为空白，1为填充。

Answer 1

您的代码中有几个错误我已经评论过了。我还添加了代码来处理边缘条件。

#include <stdio.h>

#define WIDTH 30            // don't hard code the dimensions etc.

void rule(int t[]);

int main(void) {
    int count = 0, i;
    int t[] = {0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0};
    while (count++ < 20) {
        for (i = 0; i < WIDTH; i++) {
            printf("%d", t[i]);             // error here was *t
        }
        printf("\n");
        rule(t);                            // moved outside of print loop
    }
    return 0;
}

void rule(int t[]) {
    int t1[WIDTH];
    int ix, lx, rx, i;

    for (ix=0; ix < WIDTH; ix++) {
        lx = (ix + WIDTH - 1) % WIDTH;      // left pixel wraps to other end
        rx = (ix + 1) % WIDTH;              // right pixel wraps to other end

        if ((t[lx] == 0) && (t[ix] == 0) && (t[rx] == 0)) {
            t1[ix] = 0;
        }
        else if ((t[lx] == 0) && (t[ix] == 0) && (t[rx] == 1)) {
            t1[ix] = 1; 
        }
        else if ((t[lx] == 0) && (t[ix] == 1) && (t[rx] == 0)) {
            t1[ix] = 1;
        }
        else if ((t[lx] == 0) && (t[ix] == 1) && (t[rx] == 1)) {
            t1[ix] = 1;
        }
        else if ((t[lx] == 1) && (t[ix] == 0) && (t[rx] == 0)) {
            t1[ix] = 0;
        }
        else if ((t[lx] == 1) && (t[ix] == 0) && (t[rx] == 1)) {
            t1[ix] = 1;
        }
        else if ((t[lx] == 1) && (t[ix] == 1) && (t[rx] == 0)) {
            t1[ix] = 1;
        }
        else 
            t1[ix] = 0;
    }
    for (i = 0; i < WIDTH; i++) {
        t[i] = t1[i];                   // error here was t[ix] = t1[ix]
    }
}

使用一维数组实现规则 110 元胞自动机

Implementing a rule 110 cellular automata using 1D arrays

c

arrays

cellular-automata