Game of Life Project Description: The goal of this project is to create a simulation of John Conway’s Game of Life using two-dimensional arrays.
c/c++代写,java代写,python代写,matlab代写,作业代写,留学生作业代写
Game of Life Project Description: The goal of this project is to create a simulation of John Conway’s Game of Life using two-dimensional arrays. Each element of the array represents a cell that is either alive or dead. Once an initial state is set up, the program will generate new generations based on the following Rules of the Game: - A live cell with two or three live neighbors will remain alive. - A live cell with fewer than two live neighbors will die. - A live cell with more than three live neighbors will die. - A dead cell with exactly three live neighbors will become a live cell. The “neighbors” of a cell are the adjacent and diagonal cells. Purpose: This project will be the culmination of the content discussed in this course. - Design: You will be building a function hierarchy that will make managing this process easier. Lowlevel functions that will act as tools on top of which higher level functions will be build upon. This is the most important part of this project as we spent a great deal of time talking about this issue not to mention all the projects we built with these ideas in mind. - Flow of Control: The process of creating consecutive generations will be near impossible to do without using various nested loops. - Functions: There will be many functions used to break down the project into specific tasks that must be performed each time a new generation is generated. - Input/Output streams: Files will be used to import and export a pattern or generation’s current state. - Arrays: This is the heart of the project; a two-dimensional array is used to represent a generation of cells, with each element of the array representing an individual cell. Design Specifications: There must be a temporary holding place for each new generation: Main Two Dimensional Array: There will be a main 2D array that will represent the state of the current generation. Temporary Array: When creating the next generation, changes made to the main array will interfere with the current generation’s actual state. The temporary array will be used to determine which cells in the next generation are alive and which are dead. Once every cell has been processed, transfer the temporary cell’s state to the main array so that the process may be repeated. CIRCULAR: The board is virtually connected by the edges and the corners: The first row and the last row are neighbors (adjacent) and the first column and the last column are neighbors (adjacent) so, a cell on the first row will have neighbors on the last row. Consider the example of the top-left corner cell: This cell must be able to use the last 2 cells on the bottom, the last 2 cells on the right, and the lower-right corner cell as its neighbors. By using the border to reflect those cells, the task of checking the neighbors of the corner cell is greatly simplified. SAVE/LOAD: Patterns can be exported and imported to and from text files. The text files will simply be characters used to represent consecutive cells as either alive or dead, separated by line breaks to differentiate between rows. MENU: These are necessary functions: Displaying Generations: - Step: Display the next generation. - Go: Loop consecutive generations. - Pause: Pause at a specific generation. Input/Output files: - SavePattern: Save a specific pattern to a file. Will need two sets of coordinates representing the top-left cell and bottom-right cell in which the pattern is contained. - LoadPattern: Import a pattern from a file into the array. Will need a single set of coordinates to indicate where the pattern will begin. - SaveScreen: Save the entire two-dimensional array to a file. - LoadScreen: Import a saved screen into the array. Useful for testing the SaveScreen function. Altering the Cells: - Random: Add 50 random live cells to the world. - BringToLife: Bring the cell at a specific set of coordinates to life. - Kill: Kill a specific cell. - KillAll: Clear the entire array. Common Patters: - Blinker Hint: Useful during initial stages of testing. - Glider Hint: Useful for testing the edges of the array. If the edge cells are connected properly, the glider should reappear in the top-left corner when it reaches the bottom-right.
留学生作业代写,cs作业代写,cs代写,作业代写,北美cs作业代写,澳洲cs作业代写,加拿大cs作业代写,cs作业代写价格,靠谱cs作业代写,程序代写