Conway's Game of life


----Life.cpp---------
#include <iostream.h>
#include <fstream.h>
#include <conio.h>

#define ROWS 20
#define COLUMNS 30

void main()
{
	bool board[ROWS][COLUMNS][2];
   int row_count = 0;
   int col_count = 0;
   int level = 0;

   for(row_count=0; row_count<ROWS; row_count++)
   {
   	for(col_count=0; col_count<COLUMNS; col_count++)
      {
      	for(level=0; level<2; level++)
         	board[row_count][col_count][level] = false;
      }
   }

   fstream input_file("data.txt", ios::in);
   char temp = input_file.get();
   row_count = 0;
   col_count = 0;
   for(int i=0; temp != EOF; i++)
   {
   	if(temp == '\n')
      {
      	row_count++;
         col_count = 0;
      }
      else if(temp == '0')
      {
      	board[row_count][col_count][0] = false;
      	col_count++;
      }
      else
      {
         board[row_count][col_count][0] = true;
         col_count++;
      }
      temp = input_file.get();
   }


	char choice = ' ';
   int generation = 1;
   level = 0;
   while(choice != 'q' && choice != 'Q')
   {
      cout << "\nGeneration #" << generation << "\n\n\n";

      // beginning of print to screen code
   	for(row_count = 0; row_count < ROWS; row_count++)
   	{
   		for(col_count = 0; col_count < COLUMNS; col_count++)
      	{
      		if(board[row_count][col_count][level])
         		cout << '*';
         	else
            	cout << ' ';
      	}
   		cout << endl;
   	}
  // ----------------- end of screen output code ------------------
  // ----------------- beginning of generation processing ----------

      for(row_count=0; row_count<ROWS; row_count++)
      {

   		for(col_count=0; col_count<COLUMNS; col_count++)
      	{
               int neighbor_count = 0;
               int up_row;
               int down_row;
               int left_column;
               int right_column;

               if(0 == row_count)
               	up_row = 19;
               else
               	up_row = row_count-1;
               if(19 == row_count)
               	down_row = 0;
               else
               	down_row = row_count+1;

               if(0 == col_count)
               	left_column = 29;
               else
               	left_column = col_count-1;
               if(29 == col_count)
               	right_column = 0;
               else
               	right_column = col_count+1;
                  
      // ---------- count the neighbors -----------------
               if(board[up_row][left_column][level])
               	neighbor_count++;
               if(board[up_row][col_count][level])
               	neighbor_count++;
               if(board[up_row][right_column][level])
               	neighbor_count++;
               if(board[row_count][left_column][level])
               	neighbor_count++;
               if(board[row_count][right_column][level])
               	neighbor_count++;
               if(board[down_row][left_column][level])
               	neighbor_count++;
               if(board[down_row][col_count][level])
               	neighbor_count++;
               if(board[down_row][right_column][level])
               	neighbor_count++;

               // ---------- The rules ---------------
               if(neighbor_count < 2 || neighbor_count >= 4)
	         		board[row_count][col_count][(level+1)%2] = false;
               else if(!board[row_count][col_count][level] && neighbor_count == 3)
                  board[row_count][col_count][(level+1)%2] = true;
               else if(board[row_count][col_count][level])
                  board[row_count][col_count][(level+1)%2] = true;
               else
                  board[row_count][col_count][(level+1)%2] = false;
      	}
   	}
      level = (level+1)%2;
		generation++;
   	cout << "\nPress Q to quit or any other key to continue.";
      choice = getch();
	}
}





------ data.txt---------
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000010000000000000000000
000000000111000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000001001000000000000
000000000000000111000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000