1. Draw board
2. Add neighbors
3. Big while loop - until user clicks the mouse button
4. Call nextGeneration function (duplicates board, then applies changes)
5. Check to make sure nextGeneration has changed (stabilized) - if yes, then exit big while loop

1. A location that has zero or one neighbors will be empty in the next generation. If a cell was in that location, it dies of loneliness.

2. A location with two neighbors is stable—that is, if it contained a cell, it still contains a cell. If it was empty, its still empty.

3. A location with three neighbors will contain a cell in the next generation. If it was unoccupied before, a new cell is born. If it currently contains a cell, the cell remains. Good times.

4. A location with four or more neighbors will be empty in the next generation. If there was a cell in that location, it dies of overcrowding.

5. The births and deaths that transform one generation to the next must all take effect simultaneously. Thus, when computing a new generation, new births and 3 deaths in that generation don’t impact other births and deaths in that generation. To keep the two generations separate, you will need to work on two versions of the grid—one for the current generation, and a second that allows you to compute and store the next generation without changing the current one.

returns array of locations of neighbors

1. Go thru each location
2. Check neighbors
3. If 0/1 -  cell dies (delete if there)
4. if 2 - stabilized, so nothing happens
5. if 3 - create new cell in location (if not already there)
6. if 4+ - dies (delete overcrowding)
7. MINUS ONE AGE (if cell there)

Checks neighbor of location x,y in direction of right, bottom

returns value of neighbor