-
Notifications
You must be signed in to change notification settings - Fork 1
/
GameOfLifeLogic.java
108 lines (101 loc) · 2.93 KB
/
GameOfLifeLogic.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
import java.util.Random;
/**
* A Java implementation of Conway's Game of Life.
* This Class will hold the game methods.
* create the matrix, calculates how many neighbors the cubes has and creating the next generation matrix.
* @author Ben Avrahami
*
*/
public class GameOfLifeLogic {
public final int SIZE;
private static final int ALIVE= 1;
private static final int DEAD= 0;
private int[][] lifeMatrix;//the array that will be used through the game
private int[][] copyMatrix;//the copy array will be used to check the neighbors without changes made to the original matrix
/**
* A GameOfLideLogic constructor
* @param size the size of the matrix
*/
public GameOfLifeLogic(int size) {
SIZE=size;//sets the SIZE final variable by the given size in the function arguments
lifeMatrix= new int [SIZE][SIZE];//creates the new matrix
copyMatrix= new int [SIZE][SIZE];//creates the copy matrix to be used later
Random rand = new Random();
int randomValue;
for(int i=0; i<SIZE ;i++) {
for (int j=0; j<SIZE ;j++) {
randomValue = rand.nextInt(2);
lifeMatrix[i][j]=randomValue;//gives lifeMatrix[i][j] a int value of 0 or 1.
}
}
}
/**
* this method returns the value at lifeMatrix[i][j]
* @param i
* @param j
* @return int value of lifeMatrix[i][j]
*/
public int scanMat(int i, int j) {
return lifeMatrix[i][j];
}
/**
* This method checks every cell value for the next generation and updates the matrix
*/
public void nextGenMat() {
int neighbors;
copyLifeMat();
for(int i=0; i<SIZE ;i++) {
for (int j=0; j<SIZE ;j++) {
neighbors=0;
neighbors=calculateAliveNeighbors(i,j);
if (lifeMatrix[i][j]==ALIVE) {
if (neighbors==2 || neighbors==3 )
lifeMatrix[i][j]=ALIVE;
if (neighbors<2 || neighbors>3)
lifeMatrix[i][j]=DEAD;
}
else if (lifeMatrix[i][j]==DEAD) {
if (neighbors==3)
lifeMatrix[i][j]=ALIVE;
}
}
}
}
private int calculateAliveNeighbors(int i, int j) {
int neighbors=0;
int left=j-1;
int up=i-1;
int right=j+1;
int down=i+1;
if (left>=0) {//will check the three left neighbors
neighbors+=copyMatrix[i][left];
if (up>=0) {
neighbors+=copyMatrix[up][left];
}
if(down<SIZE) {
neighbors+=copyMatrix[down][left];
}
}
if (right<SIZE) {//will check the three right neighbors
neighbors+=copyMatrix[i][right];
if (up>=0) {
neighbors+=copyMatrix[up][right];
}
if(down<SIZE) {
neighbors+=copyMatrix[down][right];
}
}
if (up>=0) {//checks the cell above
neighbors+=copyMatrix[up][j];
}
if (down<SIZE) {//checks the cell below
neighbors+=copyMatrix[down][j];
}
return neighbors;//returns the amount of neighbors
}
private void copyLifeMat() {//copies lifeMatrix to copyMatrix
for(int i=0; i<SIZE ;i++)
for (int j=0; j<SIZE ;j++)
copyMatrix[i][j]=lifeMatrix[i][j];
}
}