Objective:
Learn how to use pointers
Specifications:
For this assignment you will be implementing the classic cellular automata of Conway's Game of Life.

Rules:

1. A new cell is born on an empty square if is surrounded by exactly three neighboring cells
2. A cell dies of overcrowding if it has four or more neighbors
3. A cell dies of loneliness if it has zero or one neighbor
4. Any live cell with two or three live neighbors lives, unchanged, to the next generation.

Implementation details:
The initial state of the game is held in a text file named the driver code and attached to this assignment (you must use this driver program). The format will be sequences of ones and zeros. A one means that a cell is living in that square. You will determine the size of the grid display by reading the first line of the text file and seeing how many columns you will need. You will determine the number of rows in the grid by counting the lines of data.

Exampled:

00000000100000001010
00000000010000001001
11100000010100000010
10100100101010101010
00101010010010101000