// Game of Life, ASCII
// Paul Kominsky, summer 2005

#include <iostream>
#include <iomanip>
#include <vector>
using namespace std;

int neighbors(vector<vector<int> > table, int ic, int jc)
{
	int N = table.size();
	int M = table[0].size();
	int ilo=max(ic-1, 0);
	int jlo=max(jc-1, 0);
	int ihi=min(ic+1, N-1);
	int jhi=min(jc+1, M-1);
	int sum = 0;

	for (int i=ilo; i<=ihi; i=i+1)	
	{
		for (int j=jlo; j<=jhi; j=j+1)
		{
			sum = sum + table[i][j];
		}
	}
	return sum - table[ic][jc];
}

vector<vector<int> > updateCells(vector<vector<int> > cells)
{
	int N = cells.size();
	int M = cells[0].size();

	vector<vector<int> > updated(N, M);

	for (int i=0; i<N; i=i+1)
	{
		for (int j=0; j<M; j=j+1)
		{
			int count = neighbors(cells, i, j);

			if (cells[i][j] == 1 and (count==2 or count==3))
			{
				updated[i][j] = 1;
			}
			else if (cells[i][j] == 0 and count==3)
			{
				updated[i][j] = 1;
			}
		}
	}
	return updated;
}

void print(vector<vector<int> > table, int ng)
{
	system("clear");
	cout << "--- " << ng << " ---" << endl;
	int i=0, j=0;
	while (i<table.size())
	{
		j=0;
		while (j<table[i].size())
		{
			if (table[i][j])
				cout << "\2";
			else
				cout << ".";
			j=j+1;
		}
		cout << endl;
		i=i+1;
	}
}

int main()
{

	int N,M;
	cout << " What size grid (Rows x Cols)? ";
	cin >> N >> M;

	double probOne;
	cout << " What initial probability of ones? ";
	cin >> probOne;

	int numGen;
	cout << " How many generations? ";
	cin >> numGen;

	int seed;
	cout << " Random seed value? ";
	cin >> seed;

	srand(seed);

	vector<vector<int> > table(N,M);

	// fill 2D vector with random zeros and ones
	int i,j;
	i=0;
	while (i<N)
	{
		j=0;
		while (j<M)
		{
			if (rand() < probOne*RAND_MAX)
				table[i][j] = 1;
			else
				table[i][j] = 0;

			j=j+1;
		}
		i=i+1;
	}

	// now display it in a nice table format!
	print(table,0);

	vector<vector<int> > tablenew(N,M);

	int k=0;
	while (k<numGen)
	{
		tablenew = updateCells(table);
		table = tablenew;
		k=k+1;
		print(table, k);
	}
}