-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNerualNet.java
More file actions
410 lines (282 loc) · 9.06 KB
/
Copy pathNerualNet.java
File metadata and controls
410 lines (282 loc) · 9.06 KB
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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Random;
public class NerualNet{
private int sizeOfHiddenLayer;
private int numOfHiddenLayers;
private ArrayList<OSMNode> firstNodes =new ArrayList<OSMNode>();
private HashMap<Integer,OSMNode[]> hiddenNodes = new HashMap<Integer,OSMNode[]>();
private OSMNode[] outputNodes;
private ArrayList<OSMRoad> firstRoad = new ArrayList<OSMRoad>();
private HashMap<Integer,ArrayList<OSMRoad>> hiddenRoad = new HashMap<Integer,ArrayList<OSMRoad>>();
private ArrayList<OSMRoad> secondRoad = new ArrayList<OSMRoad>();
private TwoThousandFourtyEight board;
/**
*
* @param par1 size of each layer
* @param par2 number of each layer
* @param par3 board
* @param par4 learning mode
* @param par5 File path
* @param par6 index
*/
public NerualNet(int par1, int par2, TwoThousandFourtyEight par3, boolean par4, String par5, int par6) {
setSizeOfHiddenLayer(par1);
setNumOfHiddenLayers(par2);
board = par3;
Random rand = new Random();
ReaderAndWriter.createDirectory(par5+"/learning/"+par6+"/"+"roads");
outputNodes = new OSMNode[4];
int[][] a = par3.getBoard();
int h = 0;
for(int i = 0; i < a.length; i++) {
for(int j = 0; j < a[i].length; j++) {
firstNodes.add(h, new OSMNode((double)a[i][j]/par3.getHighestTile(), h, "input"));
h++;
}
}
if(!par4) {
int b = 16;
OSMNode[] nodes = new OSMNode[par1];
for(int i = 0; i < par2; i++) {
nodes =new OSMNode[par1];
for(int j = 0; j < par1; j++) {
double val = 0;
nodes[j] =new OSMNode(val, b, "hidden");
b++;
}
hiddenNodes.put(i, nodes);
}
for(int i = 0; i < 4; i++) {
double val = 0;
outputNodes[i] = new OSMNode(val, b+i, "output");
}
int RoadNum = 0;
for(OSMNode i: firstNodes) {
for(OSMNode j: hiddenNodes.get(0)) {
OSMNode[] nd = new OSMNode[2];
nd[0] = i;
nd[1] = j;
double val= Double.parseDouble(ReaderAndWriter.read(par5+"learned/roads/"+RoadNum+".txt"));
firstRoad.add(new OSMRoad(nd,val/Ai2048.maxRand, RoadNum));
RoadNum++;
}
}
//Hidden Layers input
for(int i = 1; i < hiddenNodes.size() - 1; i++) {
ArrayList<OSMRoad> roads = new ArrayList<OSMRoad>();
//System.out.println(roads.size());
for(OSMNode nodelayer2 : hiddenNodes.get(i)) {
for(OSMNode nodelayer1 : hiddenNodes.get(i-1)) {
OSMNode[] nd = new OSMNode[2];
nd[0] = nodelayer1;
nd[1] = nodelayer2;
double val= Double.parseDouble(ReaderAndWriter.read(par5+"learned/roads/"+RoadNum+".txt"));
roads.add(new OSMRoad(nd,val/Ai2048.maxRand, RoadNum));
RoadNum++;
}
}
//System.out.println(roads.size());
hiddenRoad.put(i, roads);
//System.out.println(val);
}
for(OSMNode i: hiddenNodes.get(hiddenNodes.size() -1)) {
for(OSMNode j: outputNodes) {
OSMNode[] nd = new OSMNode[2];
nd[0] = i;
nd[1] = j;
double val= Double.parseDouble(ReaderAndWriter.read(par5+"learned/roads/"+RoadNum+".txt"));
secondRoad.add(new OSMRoad(nd,val/Ai2048.maxRand, RoadNum));
//System.out.println(val);
RoadNum++;
}
}
}
else {
int b = 16;
OSMNode[] nodes = new OSMNode[par1];
for(int i = 0; i < par2; i++) {
nodes =new OSMNode[par1];
for(int j = 0; j < par1; j++) {
double val = 0;
nodes[j] =new OSMNode(val, b, "hidden");
b++;
}
hiddenNodes.put(i, nodes);
}
for(int i = 0; i < 4; i++) {
double val = 0;
outputNodes[i] = new OSMNode(val, b+i, "output");
}
int RoadNum = 0;
for(OSMNode i: firstNodes) {
for(OSMNode j: hiddenNodes.get(0)) {
OSMNode[] nd = new OSMNode[2];
nd[0] = i;
nd[1] = j;
int val= rand.nextInt(Ai2048.maxRand);
ReaderAndWriter.write(par5+"/learning/"+par6+"/"+"roads"+"/"+RoadNum +".txt", String.valueOf(val));
firstRoad.add(new OSMRoad(nd,val/Ai2048.maxRand, RoadNum));
RoadNum++;
}
}
//Hidden Layers input
for(int i = 1; i < hiddenNodes.size() - 1; i++) {
ArrayList<OSMRoad> roads = new ArrayList<OSMRoad>();
//System.out.println(roads.size());
for(OSMNode nodelayer2 : hiddenNodes.get(i)) {
for(OSMNode nodelayer1 : hiddenNodes.get(i-1)) {
OSMNode[] nd = new OSMNode[2];
nd[0] = nodelayer1;
nd[1] = nodelayer2;
int val= rand.nextInt(Ai2048.maxRand);
ReaderAndWriter.write(par5+"/learning/"+par6+"/"+"roads"+"/"+RoadNum +".txt", String.valueOf(val));
roads.add(new OSMRoad(nd,val/Ai2048.maxRand, RoadNum));
RoadNum++;
}
}
//System.out.println(roads.size());
hiddenRoad.put(i, roads);
//System.out.println(val);
}
for(OSMNode i: hiddenNodes.get(hiddenNodes.size() -1)) {
for(OSMNode j: outputNodes) {
OSMNode[] nd = new OSMNode[2];
nd[0] = i;
nd[1] = j;
int val= rand.nextInt(Ai2048.maxRand);
ReaderAndWriter.write(par5+"/learning/"+par6+"/"+"roads"+"/"+RoadNum +".txt", String.valueOf(val));
secondRoad.add(new OSMRoad(nd,val/Ai2048.maxRand, RoadNum));
RoadNum++;
//System.out.println(val);
}
}
}
}
/**
* 0 = left, 1 = right, 2= up, 3 =down
*/
public int makeDecision() {
double[] valuesAtHiddenNodes = new double[hiddenNodes.get(0).length];
for(int i = 0; i < hiddenNodes.get(0).length; i++) {
for(int j = 0; j < firstNodes.size(); j++) {
//double val = firstNodes.get(j).getLon()*hiddenNodes.get(i).getLon();
double roadVal= firstNodes.get(j).getLon() * getFirstRoad(firstNodes.get(j),hiddenNodes.get(0)[i]).getWidth();
valuesAtHiddenNodes[i] += roadVal;
}
hiddenNodes.get(0)[i].setLon(valuesAtHiddenNodes[i]);
}
double[] valuesAtHiddenNodesMutilayer = new double[sizeOfHiddenLayer];
for(int x = 1; x < hiddenNodes.size() - 1; x++) {
for(OSMNode i : hiddenNodes.get(x)) {
for(OSMNode j : hiddenNodes.get(x-1)) {
//double val = firstNodes.get(j).getLon()*hiddenNodes.get(i).getLon();
double priorval = j.getLon();
double val = 0.1;
if(getHiddenRoad(j,i) != null) {
val = getHiddenRoad(j,i).getWidth();
}
double roadVal= priorval * val;
valuesAtHiddenNodesMutilayer[x] += roadVal;
}
hiddenNodes.get(x)[x].setLon(valuesAtHiddenNodesMutilayer[x]);
}
}
HashMap<Integer, Double>valuesAtOutputNodes = new HashMap<Integer, Double>();
for(int i = 0;i < outputNodes.length; i++) {
valuesAtOutputNodes.put(i,0.0);
}
for(int i = 0; i < outputNodes.length; i++) {
for(int j = 0; j < hiddenNodes.size()-1; j++) {
double val = valuesAtHiddenNodes[j];
double val2 = getSecondRoad(hiddenNodes.get(hiddenNodes.size()-1)[j] , outputNodes[i]).getWidth();
valuesAtOutputNodes.put(i, val*val2);
}
}
double max = 0;
int index = 0;
for(int i = 0; i< valuesAtOutputNodes.size(); i++) {
if(valuesAtOutputNodes.get(i) > max) {
max = valuesAtOutputNodes.get(i);
index = i;
}
//System.out.println(valuesAtOutputNodes.get(i));
}
return index;
}
public OSMRoad getFirstRoad(OSMNode n1, OSMNode n2) {
int i =0;
while(!firstRoad.get(i).containsNode(n1) && !firstRoad.get(i).containsNode(n2)) {
i++;
}
return firstRoad.get(i);
}
public OSMRoad getHiddenRoad(OSMNode n1, OSMNode n2) {
int i;
//System.out.println("HERE" + hiddenRoad.get(0).length);
for(i = 1; i< hiddenRoad.size(); i++) {
for(OSMRoad j : hiddenRoad.get(i)){
if(j.containsNode(n1) && j.containsNode(n2))
return j;
}
}
return null;
}
public OSMRoad getSecondRoad(OSMNode n1, OSMNode n2) {
int i =0;
while(!secondRoad.get(i).containsNode(n1) && !secondRoad.get(i).containsNode(n2)) {
i++;
}
return secondRoad.get(i);
}
public int getNumOfHiddenLayers() {
return numOfHiddenLayers;
}
public void setNumOfHiddenLayers(int numOfHiddenLayers) {
this.numOfHiddenLayers = numOfHiddenLayers;
}
public int getSizeOfHiddenLayer() {
return sizeOfHiddenLayer;
}
public void move(TwoThousandFourtyEight b) {
switch(makeDecision()) {
case 0:
b.left();
case 1:
b.right();
case 2:
b.up();
case 3:
b.down();
}
ArrayList<OSMNode> ns = new ArrayList<OSMNode>();
int k =0;
for(int i = 0; i < board.getBoard().length; i++) {
for(int j = 0; j < board.getBoard()[i].length; j++) {
ns.add(new OSMNode(b.getBoard()[i][j], k, "input"));
k++;
}
}
}
public void setSizeOfHiddenLayer(int sizeOfHiddenLayer) {
this.sizeOfHiddenLayer = sizeOfHiddenLayer;
}
public void setInputNodes(ArrayList<OSMNode> nodes) {
this.firstNodes = nodes;
}
public OSMNode[] getOutputNodes() {
return outputNodes;
}
public HashMap<Integer, OSMNode[]> getHiddenNodes() {
return hiddenNodes;
}
public ArrayList<OSMNode> getInputNodes() {
return firstNodes;
}
public TwoThousandFourtyEight getBoard() {
return board;
}
public void setBoard(TwoThousandFourtyEight b) {
board = b;
}
}