-
Notifications
You must be signed in to change notification settings - Fork 1
/
exploiters.c
58 lines (57 loc) · 1.76 KB
/
exploiters.c
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
#include "landscape.h"
#include "array.h"
#include "randpois.h"
int exploiters(double ***SCAPE,int Ea,int **E, int **P,int epsiE,int deltaE,int X,int flower){
int i, j, k, n, c, m, rx[2], ry[2], disp, z, q;
for(i=0; i<Ea; i++){
disp = randpois(epsiE);
j = 0;
while(j < disp){
rx[0] = E[i][0] - deltaE;
rx[1] = E[i][0] + deltaE;
ry[0] = E[i][1] - deltaE;
ry[1] = E[i][1] + deltaE;
n = floor((rx[1]-rx[0]+1)*randunif()) - deltaE;
m = floor((ry[1]-ry[0]+1)*randunif()) - deltaE;
z = E[i][0] + n;
q = E[i][1] + m;
if(z < 0){
z = X - abs(n) + z;
}
if(z >= X){
z = n - (z - X);
}
if(q < 0){
q = X - abs(m) + q;
}
if(q >= X){
q = m - (q - X);
}
E[i][0] = z;
E[i][1] = q;
c = SCAPE[z][q][1];
if(c > 0){
for(k=0; k<flower; k++){
if(P[c][k+2] == 2){
P[c][k+2] = 4;
SCAPE[z][q][2]++;
SCAPE[z][q][1]--;
} /*
if(P[c][k+2] == 3){
P[c][k+2] = 4;
SCAPE[z][q][2]++;
SCAPE[z][q][0]--;
} */
}
/* break; */
}
j++;
}
if(randunif() > 0.2){
z = E[i][0];
q = E[i][1];
SCAPE[z][q][2]++;
} /* This if loop allows exploiters to survive multiple generations */
}
return EXIT_SUCCESS;
}