作者jinnylinr (小瓜)
看板C_and_CPP
标题[问题] 生命游戏...
时间Tue Dec 8 01:20:35 2009
目前正在进行写生命游戏的程式
说明
生命游戏（game of life）为1970年由英国数学家J. H. Conway所提出，某一细胞的邻居
包括上、下、左、右、左上、左下、右上与右下相邻之细胞，游戏规则如下：
孤单死亡：如果细胞的邻居小於一个，则该细胞在下一次状态将死亡。
拥挤死亡：如果细胞的邻居在四个以上，则该细胞在下一次状态将死亡。
稳定：如果细胞的邻居为二个或三个，则下一次状态为稳定存活。
复活：如果某位置原无细胞存活，而该位置的邻居为三个，则该位置将复活一细胞。
在24*24的方格中模拟各世代生物体的状态
程式写出来compile有过
可是生物体都没有死亡的现象,一直不断增加到饱和
不晓得是什麽缘故
可以麻烦各位帮忙看看吗@@
谢谢<(_ _)>
#include "stdafx.h"
#include "consola.h"
#include "iostream"
#include "time.h"
using namespace std;
void showlife ( void );
void nextlife ( void );
int checksquare ( int , int );
void copylife ( void );
int lifeA[24][24] = {0};
int lifeB[24][24] = {0};
int _tmain(int argc, _TCHAR* argv[])
{
srand ( time(NULL) );
// initial life
for ( int i = 0; i < 300; i++ )
{
int x = rand() % 24;
int y = rand() % 24;
lifeA[x][y] = 1;
}
while (1)
{
showlife();
delay(1000);
nextlife();
copylife();
}
gotoxy(40,20);
system("pause");
return 0;
}
void showlife ( void )
{
for ( int i = 0; i < 24; i++ )
{
for ( int j = 0; j < 24; j++ )
{
if( lifeA[i][j] == 1 )
{
gotoxy(i,j);
textcolor( LIGHTGREEN );
cout << "o" ;
}
}
}
}
void nextlife ( void )
{
// There are three conditions:
// Condition 1: born
for ( int i = 0; i < 24; i++ )
{
for ( int j = 0; j < 24; j++ )
{
if ( lifeA[i][j] == 0 && checksquare(i,j) == 3)
{
lifeB[i][j] = 1;
}
}
}
// Condition 2: dead
for ( int i = 0; i < 24; i++ )
{
for ( int j = 0; j < 24; j++ )
{
if ( lifeA[i][j] == 1 && checksquare(i,j) >= 4 || checksquare(i,j) <= 1)
{
lifeB[i][j] = 0;
}
}
}
// Condition 3: live
for ( int i = 0; i < 24; i++ )
{
for ( int j = 0; j < 24; j++ )
{
if ( lifeA[i][j] == 1 && checksquare(i,j) == 2 || checksquare(i,j) == 3 )
{
lifeB[i][j] = 1;
}
}
}
}
int checksquare ( int x, int y )
{
int sum = 0;
if ( lifeA[x-1][y-1] == 1 ) // upper left
{
sum = sum + 1;
}
if ( lifeA[x][y-1] == 1 ) // upper middle
{
sum = sum + 1;
}
if ( lifeA[x+1][y-1] == 1 ) // upper right
{
sum = sum + 1;
}
if ( lifeA[x-1][y] == 1 ) // left
{
sum = sum + 1;
}
if ( lifeA[x+1][y] == 1 ) // right
{
sum = sum + 1;
}
if ( lifeA[x-1][y+1] == 1 ) // lower left
{
sum = sum + 1;
}
if ( lifeA[x][y+1] == 1 ) // lower middle
{
sum = sum + 1;
}
if ( lifeA[x+1][y+1] == 1 ) // lower right
{
sum = sum + 1;
}
return sum;
}
void copylife ( void )
{
for ( int i = 0; i < 24; i++ )
{
for ( int j = 0; j < 24; j++ )
{
lifeA[i][j] = lifeB[i][j];
}
}
}
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 140.112.5.44
1F：推 ledia:没有把旧的画面清掉 12/08 10:02