⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 analogy.c

📁 细胞自动机的一个源代码
💻 C
字号:
/* trying to make a config file that is the analogy of 1d rule 54 in 2d    adjacent on cells -> 0   non adjecent on cells -> 1   should produce generic config file   off latice*/#include <stdio.h>int isbiton(int n, int p) {  int i, j;  return( (n>>p)&1 );}int main(void) {  int i, j, k;  int a[128];  int adj[][7] = { {1, 4, 3, -1},		   {0, 2, 3, -1},		   {1, 6, 3, -1},		   {0, 1, 2, 4, 5, 6, -1},		   {0, 5, 3, -1},		   {4, 6, 3, -1},		   {2, 5, 3, -1} };  printf("#ca non-totalistic generated config file (analogy.c)\n0\n");  printf("#dim\n2\n");  printf("#ca win len\n50\n");  printf("#ca dim\n100 100\n");  printf("#num nei\n7\n");  printf("#neighbors\n");  printf("-1 1\n");  printf("-1 0\n");  printf("0 -1\n");  printf("0 1\n");  printf("1 0\n");  printf("1 -1\n");  printf("0 0\n");  printf("#display basis\n");  printf("1.0 0.0\n");  printf("0.5 0.8660254\n");  printf("#win display vector\n");  printf("0.0 0.0 1.0\n");  printf("#number of states\n2\n");  printf("#rules (2^7 = 128)\n");  for (i=0; i<128; i++) {    a[i] = (i)%2;  }  i = 64;  while (i>1) {    a[i] = 1;    a[i+1] = 0;    i/=2;  }  for (i=0; i<128; i++) {    printf("%i ", a[i]);  }  printf("\n");}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -