-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathController.java
123 lines (104 loc) · 2.88 KB
/
Controller.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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
package exercise1;
import java.awt.Point;
import java.util.ArrayList;
public class Controller {
ArrayList<Point> Neighbour = new ArrayList<Point> ();
int dead = 0;
int alive = 0;
int i,j;
String[][] C;
public Controller(int i, int j,String[][] C, String [][] nextgen) {
this.i= i ;
this.j=j;
this.C= C;
}
public String controller(int i, int j,String[][] C,String [][] nextgen) {
// TODO Auto-generated constructor stub
// for corners
if (i == 0 && j==0) {
Neighbour.add(new Point(i,j+1));
Neighbour.add(new Point(i+1,j));
Neighbour.add(new Point(i+1,j+1));
}
else if (i == 0 && j == 39) {
Neighbour.add(new Point(i,j-1));
Neighbour.add(new Point(i+1,j));
Neighbour.add(new Point(i+1,j-1));
}
else if (i == 39 && j == 39) {
Neighbour.add(new Point(i-1,j));
Neighbour.add(new Point(i,j-1));
Neighbour.add(new Point(i-1,j-1));
}
else if (i == 39 && j == 0) {
Neighbour.add(new Point(i-1,j));
Neighbour.add(new Point(i,j+1));
Neighbour.add(new Point(i-1,j+1));
}
// for edge
else if (i == 0) {
Neighbour.add(new Point(i,j-1));
Neighbour.add(new Point(i,j+1));
Neighbour.add(new Point(i+1,j));
Neighbour.add(new Point(i+1,j-1));
Neighbour.add(new Point(i+1,j+1));
}
else if ( j == 39) {
Neighbour.add(new Point(i-1,j));
Neighbour.add(new Point(i+1,j));
Neighbour.add(new Point(i,j-1));
Neighbour.add(new Point(i-1,j-1));
Neighbour.add(new Point(i+1,j-1));
}
else if (i == 39) {
Neighbour.add(new Point(i,j-1));
Neighbour.add(new Point(i,j+1));
Neighbour.add(new Point(i-1,j));
Neighbour.add(new Point(i-1,j-1));
Neighbour.add(new Point(i-1,j+1));
}
else if ( j == 0) {
Neighbour.add(new Point(i-1,j));
Neighbour.add(new Point(i+1,j));
Neighbour.add(new Point(i,j+1));
Neighbour.add(new Point(i-1,j+1));
Neighbour.add(new Point(i+1,j+1));
}
// for middle
else {
Neighbour.add(new Point(i+1,j));
Neighbour.add(new Point(i-1,j));
Neighbour.add(new Point(i,j+1));
Neighbour.add(new Point(i,j-1));
Neighbour.add(new Point(i-1,j-1));
Neighbour.add(new Point(i+1,j-1));
Neighbour.add(new Point(i+1,j+1));
Neighbour.add(new Point(i-1,j+1));
}
for ( int k = 0; k < Neighbour.size(); k++ ) {
if (C [Neighbour.get(k).x] [Neighbour.get(k).y] == " . ") {
dead ++;
}
else if (C [Neighbour.get(k).x] [Neighbour.get(k).y] == " * ")
{
alive ++;
}
}
if (alive == 3 && C[i][j]== " . " ) {
nextgen[i][j] = " * ";
}
else if (C[i][j]== " * " && alive < 2) {
nextgen[i][j]= " . ";
}
else if (C[i][j]== " * " && alive>=2 && alive <= 3 ) {
nextgen[i][j]= " * ";
}
else if (C[i][j]== " * " && alive>3) {
nextgen[i][j]= " . ";
}
else {
nextgen[i][j]= " . ";
}
return nextgen[i][j] ;
}
}