Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

lifegame1.txt 6 7 1 2 2 3 3 1 3 2 3 3 TOPICS: 2-dimensional arrays, classes, constructors, mutators, accessors, iteration. Moderately Difficult. I NEED

image text in transcribedimage text in transcribedimage text in transcribedimage text in transcribedimage text in transcribed lifegame1.txt

6 7 1 2 2 3 3 1 3 2 3 3

TOPICS: 2-dimensional arrays, classes, constructors, mutators, accessors, iteration. Moderately Difficult.

I NEED THIS FAST PLEASE.

This assignment is based on problem P7.10 in edition 8/e of the text, Java for Everyone by Cay Horstmann. This problem is also in earlier editions. The problem involves the "Game of Life". To facilitate viewing each generation of the game you will be given two methods, 1 that sets the canvas size based on the size of the "board" and one that draws the board to the screen using StdDraw. These method may need to be modified based on the implementation of YOUR class. To implement this project you will create a class Life. The class contains a 2-D array for the game board. The data type of the array can be either character or integer (Your choice). Each element in the array represents one square in the game board that represents a "cell" that is in one of 4 states: occupied, empty/free, being born (in the next generation), or dying (in the next generation). The board evolves through a series of generations with generation 0 (zero) being the initial board with some cells occupied and the rest free. To determine the next generation you must traverse the entire array setting the state of individual cells subject to the following rules: 1. A new cell will be born if it has EXACTLY 3 occupied neighboring cells 2. A cell will die of loneliness if has one or fewer neighbors. 3. A cell will also die of overcrowding if it has 4 or more neighbors. 4. All other cells remain unchanged. The neighbors of a given cell are in pink in the diagrams below: In the current generation cells that are dying are still considered occupied, and can thus affect the state of their neighbors. Cells that are being born have no effect on surrounding cells. The class has the following members: Data members (ALL SHOULD BE PRIVATE) O A 2 dimensional array of either characters or integers. Initially it is declared without a size, but will be instantiated inside the constructors. IE: int[][] the Board o integer variables for the number of rows and columns. These values will be given by the user when an instance of the class is created. o 4 private data members (either integer or character) representing the 4 states of a cell, beingBorn, dying, free, or occupied. These will be initialized in your constructor to a value of YOUR CHOICE, either character or integer. Constructors: O A default constructor with no parameters: public Life() this method creates a 10x10 board, setting the rows, columns, and state data members appropriately. o A non-default constructor that gives the size of the board: . public Life(int row, int col) This will instantiate the board using the given number of rows and columns, and then will initialize the other data members appropriately. Accessors: o public boolean isFree(int r, int c): This method returns true if the state of the cell at row 'r' and column 'd' is "free". o public boolean isOccupied (int r, int c): This method returns true if the state of the cell at row 'r' and column 'd' is "occupied". o public boolean isDying(int r, int c): This method returns true if the state of the cell at row 'r' and column 'd' is "dying". o public boolean isBorn(int r, int c): This method returns true if the state of the cell at row 'r' and column 'c' is "beingBorn". o private int countNeighbors(int r, int c): For the cell at row r and column c this method counts and returns the number of neighbors that are either "occupied" or "dying" in the current generation. Any cell in the board potentially has 8 neighbors. To determine the indexes of the neighbors, you will need to determine how the values of r and c need to change to identify a neighboring cell. Before accessing a cell you must determine if it is in bounds, otherwise you will get an ArrayIndexOutOfBounds exception! This is a private method that is used only inside the class to count the neighbors of a cell Mutators: o public void setBorn(int r, int c): sets the cell indicated by r(row) and (col) to "beingBorn". o public void setOccupied (int r, int c): sets the cell indicated by r(row) and (col) to "occupied". o public void setDying(int r, int c): sets the cell indicated by r(row) and c (col) to "dying". o public void setFree(int r, int c): sets the cell indicated by r(row) and (col) to "free". o public void clearBoard(): this method sets all of the cells in the current board to "free" o public void fillBoard(Scanner inputFile): this method reads the contents of the data file, marking some cells in theBoard as occupied. Until the file is empty, it reads values 2 at a time, the two values represent a row/column pair which names a cell who's state should be set to "occupied". This final thing this method should do is call the "setCanvas" method that sets the canvas size for Std Draw, and then calls the drawBoard method that draws the initial board. o public void playGame(): This method will make traversals through the board as long as the board changes. If a generation produces no changes, then the method should exit. In each traversal, . this method visits EVERY cell in the board, and calls the countNeighbors method to calculate the number of neighbors the cell has, then: if the cell has 3 neighbors, and is NOT currently "occupied, it sets the state of the cell to "beingBorn" if the cell is "occupied", and has 4 or more neighbors, it sets the state of the cell to "dying" if the cell is "occupied" and has one or fewer neighbors it sets the state of the cell to "dying" At the end of the traversal of the entire board, it calls the "nextGeneration" method to calculate the next generation of the game. Finally it will redisplay the board by calling the drawBoard method. . To watch the board change gracefully, after drawing the board it is best to ask the program to "sleep" a few seconds, OR with current CPU speeds the game moves too fast to enjoy changes in each generation. To pause the game, after calling drawBoard add the command: Thread.sleep(7000); The value 7000 will cause the game to sleep for 7 seconds, 7000 is 7 miliseconds. To access this command we must deal with an exception: InterruptedException Add throws InterruptedException to both the heading of playGame method and your main method. o private void nextGeneration(): This method traverses the entire board, if a cell's state is "beingBorn" it set's it's state to "occupied". If the state is "dying" it sets it to "free". All other cells remain unchanged. This should be a private method that is used only inside the class to calculate the next generation of the game PROVIDED METHODS: These are utility methods that can be used and modified to reflect your implementation of your life class. The keyword "this" is optional but refers to the current instance of the Life class that is being played. .setCanvas is called after the board is filled, and initializes the drawing canvas for Std Draw based on the size of the board private void setCanvas () { StdDraw.setxscale (0.0, 10*this.rows); StDraw. setyscale (0.0, 10*this.cols); } drawBoard draws the board to the screen, if the cell is occupied it is drawn in blue, free cells are white. private void drawBoard() { // this assumes "cell[0][0] if the array is the upper //left corner" int x, Y; for(int i=0; i

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Semantics Of A Networked World Semantics For Grid Databases First International Ifip Conference Icsnw 2004 Paris France June 2004 Revised Selected Papers Lncs 3226

Authors: Mokrane Bouzeghoub ,Carole Goble ,Vipul Kashyap ,Stefano Spaccapietra

2004 Edition

3540236090, 978-3540236092

More Books

Students also viewed these Databases questions