Computer Science A - Births Function - 12/3/99

    int neighborCount;
    bool same; //only truly needed with deaths

    noBorn = ...;
    for(int row = 0; row < MAX; row++)
        for(int col = 0; col < MAX; col++)
            if(currentBoard[row][col] == ...)
            {
                neighborCount == ...;
                for(int row2 = row - 1; row2 <= row + 1; row2++)
                    for(int col2 = ...)
                        if(row2 >= 0 && row2 < MAX &&
                           col2 ... && col2 ...)
                        {
                            same = false;
                            if(row2 == row && col2 == col)
                                same = ...;
                            if(currentBoard[row2][col2] == '*' &&
                               !same)
                                ...
                        }
                if(neighborCount == ...)
                {
                    ...
                }
            }