-
Notifications
You must be signed in to change notification settings - Fork 0
/
Bird.pde
112 lines (79 loc) · 2.66 KB
/
Bird.pde
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
public class Bird{
PVector position = new PVector();
PVector velocity = new PVector();
PVector acceleration = new PVector();
ArrayList<PipePair> obstacles = new ArrayList();
NeuralNetwork brain;
int GRAVITY = 3;//3
int dimension;
int red;
int green;
int blue;
public Bird(int x, int y,int dimension, int red, int green, int blue,
ArrayList<PipePair> obstacles){
this.position = new PVector(x,y);
this.velocity = new PVector(0,0);
this.acceleration = new PVector(0,GRAVITY);
this.obstacles = obstacles;
this.dimension = dimension;
this.red = red;
this.green = green;
this.blue = blue;
this.brain = new NeuralNetwork(4,3,1);
}
public Bird(int x, int y,int dimension, int red, int green, int blue,
ArrayList<PipePair> obstacles, NeuralNetwork brain){
this.position = new PVector(x,y);
this.velocity = new PVector(0,0);
this.acceleration = new PVector(0,GRAVITY);
this.obstacles = obstacles;
this.dimension = dimension;
this.red = red;
this.green = green;
this.blue = blue;
this.brain = brain;
}
public void update(){
this.velocity.x += this.acceleration.x;
this.velocity.y += this.acceleration.y;
this.position.x += this.velocity.x;
this.position.y += this.velocity.y;
fill(red, green, blue);
ellipse(position.x, position.y, dimension, dimension);
PipePair nearest = checkNearestPipePair(obstacles);
double[] inputs = {position.x, position.y, nearest.positionTop.x, nearest.positionTop.y};
double[] output = brain.feedforward(inputs);
if(output[0]==1){
jump();
}
}
public boolean isAlive(){
PipePair nearest = checkNearestPipePair(obstacles);
if((position.x>= nearest.positionTop.x) &&
((position.y- dimension/2 < nearest.positionTop.y) ||
(position.y + dimension/2 > nearest.positionBottom.y))){
return false;
}
return true;
}
public void jump(){
this.velocity.x=0;
this.velocity.y=0;
this.velocity.y = -45;
}
public PipePair checkNearestPipePair(ArrayList<PipePair> pipes){
PipePair nearest = pipes.get(1);
int distance;
int nearestDistance;
for(PipePair p : pipes){
nearestDistance = (int)(nearest.positionTop.x + nearest.PIPE_WIDTH - position.x);
distance = (int)(p.positionTop.x + p.PIPE_WIDTH - position.x);
if((distance < nearestDistance)&&(distance>0)){
nearest = p;
}
stroke(30);
//line(position.x, position.y, nearest.positionTop.x+nearest.PIPE_WIDTH, position.y);
}
return nearest;
}
}