You will write a Java program that implements Conway’s Game of Life, a simple ce

Question

You will write a Java program that implements Conway’s Game of Life, a simple cellular automaton discussed in class. See for example: http://www.bitstorm.org/gameoflife/ Our simplified version has a 10 x 10 grid, numbered like this:

    0 1 2 3 4 5 6 7 8 9

0

1

2

3

4

5

6

7

8

9

The grid is represented by a 10 x 10 2-dimensional integer array. If the grid point (i, j) is “populated”, the array element [i][j] contains 1; otherwise it contains 0. Elements along the edges, i == 0 or 9, or j == 0 or 9, are always unpopulated. When we display the grid, a populated cell is indicated by a ‘#’; an unpopulated cell is indicated by a space. What your program should do: Prompt the user to enter a list of (i,j) pairs (both non-negative integers) (stop when a negative integer is read for either i or j) Prompt the user to enter the number of time steps Initialize the grid based on the (i,j) pairs entered by the user Display the initial state of the grid (call the displayGrid() method)

For each time step, update the grid according to Conway’s rules (call the updateGrid() method) display the grid (call the displayGrid() method) We follow Conway’s standard rules for updating the cells. For a cell that is “populated”, if the cell has <= 1 neighbors, or > = 4 neighbors, it dies (becomes 0). Otherwise, it survives (remains 1). For a cell that is not populated, if the cell has exactly 3 neighbors, it becomes populated (becomes 1). Cells on the edge always remain unpopulated (0). Some sample runs are shown in text files on libra in ~whsu/csc210/P8/. The displayGrid() method has prototype: void displayGrid(int mat[][]); It displays the borders of the grid (see sample runs below), and prints the 10 x 10 grid of cells. Populated cells are indicated with a ‘#’ sign, unpopulated cells with a space. The updateGrid() method has prototype: void updateGrid(int mat[][]); mat is the 2-dimensional array that contains the current state of the grid. The method counts the neighbors in each cell of the grid, updates the cells in the grid according to Conway’s rules, and returns the grid.

You can obviously enter arbitrary initial conditions to test your program. Some fun examples adapted from the bitstorm.org site: Glider (in ~whsu/csc210/P8/glider on libra); initial populated cells at (3, 4) (4, 2) (4, 4) (5, 3) (5, 4) 5 cell row (in ~whsu/csc210/P8/row on libra); initial populated cells at (6,4) (6,5) (6,6) (6,7) (6,8) Small explosion (in ~whsu/csc210/P8/smallex on libra); initial populated cells at (4, 5) (4,6) (5,4) (5,5) (5, 7) (6, 5) (6,6) Note that these will not behave exactly the same as the bitstorm.org display when the populated cells run into the boundary conditions.

Explanation / Answer

Sample code:

Related Questions

Navigate

• Browse (All)
• Browse Y
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.