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
124
125
126
127
128
129
130
131
132
133
134
|
package fun;
import java.util.LinkedList;
import java.util.Random;
public class Life {
public static void main(String[] args){
Life life=new Life(args);
life.simulate();
}
public Life(String[] args){
xdim=Integer.parseInt(args[0]);
ydim=Integer.parseInt(args[1]);
rounds=Integer.parseInt(args[2]);
prob=Float.parseFloat(args[3]);
}
void simulate(){
grid=new int[xdim][ydim];
int[][] nextGrid=new int[xdim][ydim];
initialize();
LinkedList<int[][]> queue=new LinkedList<int[][]>();
for(int i=0; i<rounds; i++){
print(i);
int count=fill(nextGrid);
int[][] temp=grid;
grid=nextGrid;
nextGrid=temp;
// if(count<1){break;}
// if(equals(grid, nextGrid)){break;}
for(int[][] x : queue){
if(equals(grid, x)){return;}
}
queue.add(copy(grid));
if(queue.size()>10){queue.poll();}
// long time=System.nanoTime();
// long next=time+50000000;
// while(System.nanoTime()<next);
}
}
int[][] copy(int[][] a){
int[][] b=new int[xdim][ydim];
for(int x=0; x<xdim; x++){
for(int y=0; y<ydim; y++){
b[x][y]=a[x][y];
}
}
return b;
}
boolean equals(int[][] a, int[][] b){
for(int x=0; x<xdim; x++){
for(int y=0; y<ydim; y++){
if(a[x][y]!=b[x][y]){return false;}
}
}
return true;
}
void initialize(){
Random randy=new Random();
for(int x=0; x<xdim; x++){
for(int y=0; y<ydim; y++){
grid[x][y]=(randy.nextFloat()<prob ? 1 : 0);
}
}
}
int fill(int[][] nextGrid){
int count=0;
for(int x=0; x<xdim; x++){
for(int y=0; y<ydim; y++){
int z=next(x, y);
nextGrid[x][y]=z;
count+=z;
}
}
return count;
}
int next(int x, int y){
int sum=neighbors(x, y);
return (sum==3 || (sum==2 && grid[x][y]==1)) ? 1 : 0;
}
int neighbors(int x, int y){
// int minX=Tools.max(x-1, 0);
// int minY=Tools.max(y-1, 0);
// int maxX=Tools.min(x+1, xdim-1);
// int maxY=Tools.min(y+1, ydim-1);
int sum=-grid[x][y];
// for(int i=minX; i<=maxX; i++){
// for(int j=minY; j<=maxY; j++){
// sum+=grid[i][j];
// }
// }
for(int i=-1; i<=1; i++){
for(int j=-1; j<=1; j++){
sum+=grid[(i+x+xdim)%xdim][(j+y+ydim)%ydim];
}
}
return sum;
}
void print(int round){
StringBuilder sb=new StringBuilder();
System.out.print("\033[H\033[2J");
sb.append("\nRound "+round+"\n");
for(int x=0; x<xdim; x++){
for(int y=0; y<ydim; y++){
sb.append(grid[x][y]==0 ? ' ' : '@');
}
sb.append('\n');
}
// System.out.print("\033[H\033[2J");
// System.out.flush();
System.out.println(sb);
System.out.flush();
}
int[][] grid;
int xdim, ydim, rounds;
float prob;
}
|
