生命游戏C++版
生命游戏简介，编程过程（C++），附源代码
文章共6,108字 · 阅读需要大约21分钟
一键AI生成摘要，助你高效阅读
问答
·
目录
生命游戏
由剑桥大学约翰·何顿·康威设计的计算机程序。美国趣味数学大师马丁·加德纳(Martin Gardner，1914-2010）通过《科学美国人》杂志，将康威的生命游戏介绍给学术界之外的广大渎者，一时吸引了各行各业一大批人的兴趣，这时细胞自动机课题才吸引了科学家的注意。
游戏概述
用一个二维表格表示“生存空间”，空间的每个方格中都可放置一个生命细胞，每个生命细胞只有两种状态：“生”或“死”。用绿色方格表示该细胞为“生”，空格(白色)表示该细胞为“死”。或者说方格网中绿色部分表示某个时候某种“生命”的分布图。生命游戏想要模拟的是：随着时间的流逝，这个分布图将如何一代一代地变化。死亡太沉重，我想称它为“湮灭”状态。
生存定律
生存空间的每个方格都存在一个细胞，它的周边紧邻的8个方格上的称为邻居细胞。
(1)当前细胞为湮灭状态时，当周围有３个存活细胞时，则迭代后该细胞变成存活状态(模拟繁殖)。
(2)当前细胞为存活状态时，当周围的邻居细胞少于２个存活时，该细胞变成湮灭状态(数量稀少)。
(3)当前细胞为存活状态时，当周围有３个以上的存活细胞时，该细胞变成湮灭状态(数量过多)。
(4)当前细胞为存活状态时，当周围有２个或３个存活细胞时，该细胞保持原样。
简单来说，活细胞Cell看作是‘1’，死Cell看作‘0’，8个邻居的累加和Sum决定了下一轮的状态：
“繁殖”：死Cell=0，若Sum=3，则Cell=1。
“稀少”：活Cell=1，若Sum<2，则Cell=0。
“过多”：活Cell=1，若Sum>3，则Cell=0。
“正常”：活Cell=1，若Sum=2或3，则Cell=1。
生存空间中生命的繁殖和湮灭，如下图所示：
图形结构
在游戏进行中，杂乱无序的细胞会逐渐演化出各种精致、有形的图形结构；这些结构往往有很好的对称性，而且每一代都在变化形状。一些形状一经锁定就不会逐代变化。有时，一些已经成形的结构会因为一些无序细胞的“入侵”而被破坏。但是形状和秩序经常能从杂乱中产生出来。
通常会有以下四种状态：
不动点（fixed points）：变化终结于恒定图像
交替态（alternation）：图像出现周期性变化
随机态（randomness）：图像变化近乎随机
复杂态（complexity）：图像存在某种复杂规律
（以上为参考资料）
版权声明：本文为CSDN博主「Hann Yang」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。
原文链接：https://blog.csdn.net/boysoft2002/article/details/126131069
接下来，我们就用C++来尝试一下吧。
主要代码
1.头文件
#include<iostream>
#include<conio.h>
#include<windows.h>
#include<stdlib.h>
#include<time.h>
using namespace std;
#define GEN 99999
#define N 39
int a[N][N][GEN];
int nock;GEN是代数，N是地图大小，都可以修改。
2.移动光标
void gotoxy(int x, int y){
HANDLE handle = GetStdHandle(STD_OUTPUT_HANDLE);
COORD pos;
pos.X = x;
pos.Y = y;
SetConsoleCursorPosition(handle, pos);
}3.显示结果
void show(int g){
gotoxy(0, 0);//移动到首格
int i, j,kk;
cout << "第" << g<< "代" << endl << "--------------------------------------------------------------------------------" << endl;
for (i = 0;i < N;i++){//打印的行数
for (j = 0;j < N;j++){//打印的列数
if (a[i][j][g] ==1){//存活的细胞
cout <<"■";
kk++;
}else{
if (a[i][j][g] ==0){//死亡的细胞
cout <<" ";
}
}
}
cout<<endl;
}
cout<< "--------------------------------------------------------------------------------" << endl<<"细胞数量："<<kk<<"个"<<endl;
kk=0;
}4.运算部分
void update(int k)
{
int i,j, count = 0;
for (i = 0;i < N;i++)
for (j = 0;j < N;j++)
{
count = 0;
if (i == 0 && j == 0)
{
if (a[i][j + 1][k] == 1)
count++;
else if (a[i + 1][j][k] == 1)
count++;
else if (a[i + 1][j + 1][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
else if (count == 2)
a[i][j][k + 1] = a[i][j][k];
else if (count == 3)
a[i][j][k + 1] = 1;
}
if (i == 0 && j != 0 && j != N - 1)
{
if (a[i][j - 1][k] == 1)
count++;
if (a[i][j + 1][k] == 1)
count++;
if (a[i + 1][j - 1][k] == 1)
count++;
if (a[i + 1][j][k] == 1)
count++;
if (a[i + 1][j + 1][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
if (i == 0 && j == N - 1)
{
if (a[i][j - 1][k] == 1)
count++;
if (a[i + 1][j - 1][k] == 1)
count++;
if (a[i + 1][j][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
if (i != 0 && i != N - 1 && j == 0)
{
count = 0;
if (a[i - 1][j][k] == 1)
count++;
if (a[i - 1][j + 1][k] == 1)
count++;
if (a[i][j + 1][k] == 1)
count++;
if (a[i + 1][j][k] == 1)
count++;
if (a[i + 1][j + 1][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
if (i == N - 1 && j == 0)
{
count = 0;
if (a[i - 1][j][k] == 1)
count++;
if (a[i - 1][j + 1][k] == 1)
count++;
if (a[i][j + 1][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
if (i == N - 1 && j != 0 && j != N - 1)
{
count = 0;
if (a[i - 1][j - 1][k] == 1)
count++;
if (a[i - 1][j][k] == 1)
count++;
if (a[i - 1][j + 1][k] == 1)
count++;
if (a[i][j - 1][k] == 1)
count++;
if (a[i][j + 1][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
if (j == N - 1 && i != 0 && i != N - 1)
{
count = 0;
if (a[i - 1][j - 1][k] == 1)
count++;
if (a[i - 1][j][k] == 1)
count++;
if (a[i][j - 1][k] == 1)
count++;
if (a[i + 1][j - 1][k] == 1)
count++;
if (a[i + 1][j][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
if (i == N - 1 && j == N - 1)
{
count = 0;
if (a[i - 1][j - 1][k] == 1)
count++;
if (a[i - 1][j][k] == 1)
count++;
if (a[i][j - 1][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
else if (i != 0 && j != 0 && i != N - 1 && j != N - 1)
{
count = 0;
if (a[i - 1][j - 1][k] == 1)
count++;
if (a[i - 1][j][k] == 1)
count++;
if (a[i - 1][j + 1][k] == 1)
count++;
if (a[i][j - 1][k] == 1)
count++;
if (a[i][j + 1][k] == 1)
count++;
if (a[i + 1][j - 1][k] == 1)
count++;
if (a[i + 1][j][k] == 1)
count++;
if (a[i + 1][j + 1][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
}
}5.int main
int main(){
system("color F0");//黑框子太难看了，换个颜色
int i, j, k, count;
srand(time(NULL));
for (i = 0;i < N ;i++)
for (j = 0 ;j < N ;j++)
a[i][j][0] = rand() %2;
for (i = 0;i < GEN;i++)
{
show(i);
update(i);
Sleep(200);//停顿200毫秒
}
return 0;
}修改
bug1
然而，我编完后看了下结果，不禁怀疑我自己编出来个什么玩意儿，至少应该最大化然后居中一下（才能符合强迫症的美感）才能显示完整。
void full(){ //最大化居中
HWND hwnd = GetForegroundWindow();
int cx = GetSystemMetrics(SM_CXSCREEN);
int cy = GetSystemMetrics(SM_CYSCREEN);
LONG l_WinStyle = GetWindowLong(hwnd,GWL_STYLE);
SetWindowLong(hwnd,GWL_STYLE,(l_WinStyle | WS_POPUP | WS_MAXIMIZE) & ~WS_CAPTION & ~WS_THICKFRAME & ~WS_BORDER);
SetWindowPos(hwnd, HWND_TOP,300,0, cx, cy, 0);
}bug2
OK,这个问题解决了，只不过这个光标看起来也太难受了吧！于是我就解决（显摆）了下。
void hide(){//隐藏光标
HANDLE han = GetStdHandle(-11);
CONSOLE_CURSOR_INFO cursor;
cursor.bVisible = 0;
cursor.dwSize = 1;
SetConsoleCursorInfo(han,&cursor);
}bug3
还有一个最重要的问题，这……输出地也太卡了吧！必须得改！
void show(int g){
gotoxy(0, 0);
int i, j,kk[GEN],nn,ii,jj,num;
cout << "第" << g<< "代" << endl << "--------------------------------------------------------------------------------" << endl;
for (i = 0;i < N;i++){
for (j = 0;j < N;j++){
if (a[i][j][g] ==1==true&&a[i][j][g-1] ==0==true){
ii=i*2;
jj=j+2;
gotoxy(ii,jj);
cout <<"■";
}
if (a[i][j][g-1] == 1==true&&a[i][j][g] == 0==true){
ii=i*2;
jj=j+2;
gotoxy(ii,jj);
cout <<" ";
}
if (a[i][j][g] ==1){
kk[g]++;
}
}
}
if(kk[g]!=kk[g-1]){
gotoxy(0,N+2);
cout<< "--------------------------------------------------------------------------------" << endl<<"细胞数量："<<kk[g]<<"个"<<endl;
}
}这样写省下了很多不必要的时间，测试一下，前20代还是有点慢，但后面简直快得飞起，于是我也改了下int main:
int main(){
system("color F0");
full();
hide();
int i, j, k, count;
srand(time(NULL));
for (i = 0;i < N ;i++)
for (j = 0 ;j < N ;j++)
a[i][j][0] = rand() %2;
for (i = 0;i < GEN;i++)
{
show(i);
update(i);
if(i>20){
Sleep(50);
}//大于20代就等待50微秒
}
return 0;
}bug4
最后一个问题，总是会陷入死循环，于是我做了一个检测到循环就暂停的装置。
void show(int g){
gotoxy(0, 0);
int i, j,kk[GEN],nn,ii,jj,num;
cout << "第" << g<< "代" << endl << "--------------------------------------------------------------------------------" << endl;
for (i = 0;i < N;i++){
for (j = 0;j < N;j++){
if (a[i][j][g] ==1==true&&a[i][j][g-1] ==0==true){
ii=i*2;
jj=j+2;
gotoxy(ii,jj);
cout <<"■";
}
if (a[i][j][g-1] == 1==true&&a[i][j][g] == 0==true){
ii=i*2;
jj=j+2;
gotoxy(ii,jj);
cout <<" ";
}
if(a[i][j][g]==1==true&&a[i][j][g-16]==1==true){
num++;
}
if (a[i][j][g] ==1){
kk[g]++;
}
}
}
if(kk[g]!=kk[g-1]){
gotoxy(0,N+2);
cout<< "--------------------------------------------------------------------------------" << endl<<"细胞数量："<<kk[g]<<"个"<<endl;
}else{
if(num==kk[g]){
nock=5;
}
}
}
int main(){
system("color F0");
full();
hide();
int i, j, k, count;
srand(time(NULL));
for (i = 0;i < N ;i++)
for (j = 0 ;j < N ;j++)
a[i][j][0] = rand() %2;
for (i = 0;i < GEN;i++)
{
show(i);
if(nock==5){
gotoxy(0,N+3);
cout<<"陷入循环！";
while(1){
Sleep(10);
}
}
update(i);
if(i>20){
Sleep(50);
}
}
return 0;
}完整代码
#include<iostream>
#include<conio.h>
#include<windows.h>
#include<stdlib.h>
#include<time.h>
using namespace std;
#define GEN 99999
#define N 39
int a[N][N][GEN];
int nock;
void hide(){
HANDLE han = GetStdHandle(-11);
CONSOLE_CURSOR_INFO cursor;
cursor.bVisible = 0;
cursor.dwSize = 1;
SetConsoleCursorInfo(han,&cursor);
}
void full(){
HWND hwnd = GetForegroundWindow();
int cx = GetSystemMetrics(SM_CXSCREEN);
int cy = GetSystemMetrics(SM_CYSCREEN);
LONG l_WinStyle = GetWindowLong(hwnd,GWL_STYLE);
SetWindowLong(hwnd,GWL_STYLE,(l_WinStyle | WS_POPUP | WS_MAXIMIZE) & ~WS_CAPTION & ~WS_THICKFRAME & ~WS_BORDER);
SetWindowPos(hwnd, HWND_TOP,300,0, cx, cy, 0);
}
void gotoxy(int x, int y){
HANDLE handle = GetStdHandle(STD_OUTPUT_HANDLE);
COORD pos;
pos.X = x;
pos.Y = y;
SetConsoleCursorPosition(handle, pos);
}
void show(int g){
gotoxy(0, 0);
int i, j,kk[GEN],nn,ii,jj,num;
cout << "第" << g<< "代" << endl << "--------------------------------------------------------------------------------" << endl;
for (i = 0;i < N;i++){
for (j = 0;j < N;j++){
if (a[i][j][g] ==1==true&&a[i][j][g-1] ==0==true){
ii=i*2;
jj=j+2;
gotoxy(ii,jj);
cout <<"■";
}
if (a[i][j][g-1] == 1==true&&a[i][j][g] == 0==true){
ii=i*2;
jj=j+2;
gotoxy(ii,jj);
cout <<" ";
}
if(a[i][j][g]==1==true&&a[i][j][g-16]==1==true){
num++;
}
if (a[i][j][g] ==1){
kk[g]++;
}
}
}
if(kk[g]!=kk[g-1]){
gotoxy(0,N+2);
cout<< "--------------------------------------------------------------------------------" << endl<<"细胞数量："<<kk[g]<<"个"<<endl;
}else{
if(num==kk[g]){
nock=5;
}
}
}
void update(int k)
{
int i,j, count = 0;
for (i = 0;i < N;i++)
for (j = 0;j < N;j++)
{
count = 0;
if (i == 0 && j == 0)
{
if (a[i][j + 1][k] == 1)
count++;
else if (a[i + 1][j][k] == 1)
count++;
else if (a[i + 1][j + 1][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
else if (count == 2)
a[i][j][k + 1] = a[i][j][k];
else if (count == 3)
a[i][j][k + 1] = 1;
}
if (i == 0 && j != 0 && j != N - 1)
{
if (a[i][j - 1][k] == 1)
count++;
if (a[i][j + 1][k] == 1)
count++;
if (a[i + 1][j - 1][k] == 1)
count++;
if (a[i + 1][j][k] == 1)
count++;
if (a[i + 1][j + 1][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
if (i == 0 && j == N - 1)
{
if (a[i][j - 1][k] == 1)
count++;
if (a[i + 1][j - 1][k] == 1)
count++;
if (a[i + 1][j][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
if (i != 0 && i != N - 1 && j == 0)
{
count = 0;
if (a[i - 1][j][k] == 1)
count++;
if (a[i - 1][j + 1][k] == 1)
count++;
if (a[i][j + 1][k] == 1)
count++;
if (a[i + 1][j][k] == 1)
count++;
if (a[i + 1][j + 1][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
if (i == N - 1 && j == 0)
{
count = 0;
if (a[i - 1][j][k] == 1)
count++;
if (a[i - 1][j + 1][k] == 1)
count++;
if (a[i][j + 1][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
if (i == N - 1 && j != 0 && j != N - 1)
{
count = 0;
if (a[i - 1][j - 1][k] == 1)
count++;
if (a[i - 1][j][k] == 1)
count++;
if (a[i - 1][j + 1][k] == 1)
count++;
if (a[i][j - 1][k] == 1)
count++;
if (a[i][j + 1][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
if (j == N - 1 && i != 0 && i != N - 1)
{
count = 0;
if (a[i - 1][j - 1][k] == 1)
count++;
if (a[i - 1][j][k] == 1)
count++;
if (a[i][j - 1][k] == 1)
count++;
if (a[i + 1][j - 1][k] == 1)
count++;
if (a[i + 1][j][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
if (i == N - 1 && j == N - 1)
{
count = 0;
if (a[i - 1][j - 1][k] == 1)
count++;
if (a[i - 1][j][k] == 1)
count++;
if (a[i][j - 1][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
else if (i != 0 && j != 0 && i != N - 1 && j != N - 1)
{
count = 0;
if (a[i - 1][j - 1][k] == 1)
count++;
if (a[i - 1][j][k] == 1)
count++;
if (a[i - 1][j + 1][k] == 1)
count++;
if (a[i][j - 1][k] == 1)
count++;
if (a[i][j + 1][k] == 1)
count++;
if (a[i + 1][j - 1][k] == 1)
count++;
if (a[i + 1][j][k] == 1)
count++;
if (a[i + 1][j + 1][k] == 1)
count++;
if (count <= 1 || count >= 4)
a[i][j][k + 1] = 0;
if (count == 2)
a[i][j][k + 1] = a[i][j][k];
if (count == 3)
a[i][j][k + 1] = 1;
}
}
}
int main(){
system("color F0");
full();
hide();
int i, j, k, count;
srand(time(NULL));
for (i = 0;i < N ;i++)
for (j = 0 ;j < N ;j++)
a[i][j][0] = rand() %2;
for (i = 0;i < GEN;i++)
{
show(i);
if(nock==5){
gotoxy(0,N+3);
cout<<"陷入循环！";
while(1){
Sleep(10);
}
}
update(i);
if(i>20){
Sleep(50);
}
}
return 0;
}
旨在为数千万中国开发者提供一个无缝且高效的云端环境，以支持学习、使用和贡献开源项目。
更多推荐
7
0- 0
已为社区贡献1条内容
所有评论(0)