Question: Using all previous code how does on code the function for updating board? The following rules govern the birth and/or death of cells between two


Using all previous code how does on code the function for updating board?
The following rules govern the birth and/or death of cells between two time periods. 1. At time T A cell is born if there was none at time T-1 and exactly three of its neighbors were alive 2. An existing cell remains alive if at time T-1 there were either 2 or 3 neighbors 3. A cell dies from isolation if at time T-1 there were fewer than 2 neighbors 4. A cell dies from overcrowding if at time T-1 there were more than 3 neighbors
def update(society): temp = initialSociety()
return temp
-def initialSociety(): society = [ ['_'. [ [ [ '], '] '], '], '], ]] [ [ return society =def show (theSociety): for r in range(len(the Society)): for c in range(len(theSociety[r])): print(the Society[r][c], end="") print() def neighborCount(society, row, col): nRows = len(society) nCols = len(society[e]) count = 0 for r in range (row - 1, row + 2, 1): for c in range(col - 1, col + 2, 1): if r == row and c == col: # don't count yourself foo = -99 # garbage else: rowToCheck = r colToCheck = C if r == -1: rowToCheck = nRows - 1 if r == nRows: rowToCheck = 0 if c == -1: colToCheck = nCols - 1 if c == nCols: colToCheck = 0 "O': if society[rowToCheck][colToCheck] count += 1 return count
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
