Question

For PYTHON you must design and program a function that receives a square matrix of 0s and 1s of arbitrary size and a generation number.
Each cell in the automaton is represented by an element of the matrix with 0 if it is dead or 1 if it is alive. A generation is defined as the application of the rules of the cellular automaton to each cell, generating a new matrix with the results. The function to be programmed must return to the last generation required by the second argument of the function.

Note: your function must accept any matrix from size 1
Valid generations are positive integers greater than or equal to 0

PYTHON Program

Answer 1

Here is the solution. let me know if you need any clarification or face any problems

Source : CellularAutomaton.py

def compute_generation(cell_matrix:[[]], generation:int): dead = 0 alive = 1 if generation == 0: return cell_matrix # create a temporary board generation_matrix = [[] for i in range(len(cell_matrix))] for i in range(len(cell_matrix)): generation_matrix[i] = [] for j in range(len(cell_matrix[0])): neighbours = count_neighbours(cell_matrix,i,j) # if the cell is dead if cell_matrix[i][j] == dead: # if the dead cell has 3 exactly neighbours if neighbours == 3: # cell becomes alive by reproduction cell = alive else: # cell remain dead cell = dead else: # if alive neighbour cell count less than 2 or greater than 3 if neighbours < 2 or neighbours > 3: # cell dies either by loneliness or starvation due to over population cell = dead else: # cell survives to next generation cell = alive # set cell status in generation matrix generation_matrix[i].append(cell) # recursive call to cell_matrix = compute_generation(generation_matrix, generation - 1) return cell_matrix def get_cell (cell_matrix:[[]],row:int, col:int): # if row or col is out of bound of matrix, return 0, indicating dead cell or no cell if row < 0 or row >= len(cell_matrix) or col < 0 or col >= len(cell_matrix[0]): return 0 # else return the value at the position return cell_matrix[row][col] def count_neighbours(cell_matrix:[[]],row:int, col:int): # neighbour counter count = 0 # checking 8 neighbour cells if get_cell(cell_matrix,row-1,col-1) != 0 : count += 1 if get_cell(cell_matrix,row-1,col)!=0: count +=1 if get_cell(cell_matrix,row-1,col+1)!=0: count +=1 if get_cell(cell_matrix,row,col-1)!=0: count +=1 if get_cell(cell_matrix,row,col+1)!=0: count +=1 if get_cell(cell_matrix,row+1,col-1)!=0: count +=1 if get_cell(cell_matrix,row+1,col)!=0: count +=1 if get_cell(cell_matrix,row+1,col+1)!=0: count +=1 # return neighbor count return count if __name__ =="__main__": cell_matrix = [] cell_matrix.append([0,0,0,0,0,0,0,0,0]) cell_matrix.append([0,0,0,0,0,0,0,0,0]) cell_matrix.append([0,0,0,0,1,1,1,0,0]) cell_matrix.append([0,0,1,0,0,0,0,1,0]) cell_matrix.append([0,0,1,0,0,0,0,1,0]) cell_matrix.append([0,0,1,0,0,0,0,1,0]) cell_matrix.append([0,0,0,0,0,0,0,0,0]) cell_matrix.append([0,0,0,0,1,1,1,0,0]) cell_matrix.append([0,0,0,0,0,0,0,0,0]) cell_matrix.append([0,0,0,0,0,0,0,0,0]) print("====================================") print("Generation : ",0) print("====================================") for i in range(len(cell_matrix)): print(cell_matrix[i]) # compute generation generation = 3 cell_matrix = compute_generation(cell_matrix, generation) print("====================================") print("Generation : ",generation) print("====================================") for i in range(len(cell_matrix)): print(cell_matrix[i])

Screens: Source

Screens: Output