-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathleakBomb.js
More file actions
161 lines (144 loc) · 5.54 KB
/
leakBomb.js
File metadata and controls
161 lines (144 loc) · 5.54 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
function leakBombs(graph){
const { map, size, players, bombs} = graph;
let direction = '';
let idPlayer = players.findIndex((item) => {
return item.id == playerId;
});
let idPlayerBoss = players.findIndex((item) => {
return item.id != playerId;
});
let start = players[idPlayer].currentPosition;
let powerMe = players[idPlayer].power;
let posBoss = players[idPlayerBoss].currentPosition;
let powerBoss = players[idPlayerBoss].power;
let moves = new Array();
let openList = new Array();
var closedList = new Array(size.rows);
for(let i=0;i < size.rows; i++){
closedList[i] = new Array(size.cols);
};
//init closedList values to 0;
for(let i=0;i < size.rows; i++){
for(let j=0; j < size.cols; j++){
closedList[i][j] = 0;
}
}
//add position Boss
closedList[posBoss.row][posBoss.col] = 8;
//add bombs
for (let item of bombs){
closedList[item.row][item.col] = 8;
if( 200 < item.remainTime < 1000){
if(item.playerId == playerId){
for( let i=1; i < powerMe+1; i++){
if(item.col-i > 0){
closedList[item.row][item.col-i] = 9;
}
if(item.col+i < 25){
closedList[item.row][item.col+i] = 9;
}
if(item.row-i > 0){
closedList[item.row-i][item.col] = 9;
}
if(item.row+i < 13){
closedList[item.row+i][item.col] = 9;
}
}
}else {
for( let i=1; i < powerBoss+1; i++){
if(item.col-i > 0){
closedList[item.row][item.col-i] = 9;
}
if(item.col+i < 25){
closedList[item.row][item.col+i] = 9;
}
if(item.row-i > 0){
closedList[item.row-i][item.col] = 9;
}
if(item.row+i < 13){
closedList[item.row+i][item.col] = 9;
}
}
}
}
if( item.remainTime < 200){
if(item.playerId == playerId){
for( let i=1; i < powerMe+1; i++){
if(item.col-i > 0){
closedList[item.row][item.col-i] = 8;
}
if(item.col+i < 25){
closedList[item.row][item.col+i] = 8;
}
if(item.row-i > 0){
closedList[item.row-i][item.col] = 8;
}
if(item.row+i < 13){
closedList[item.row+i][item.col] = 8;
}
}
}else {
for( let i=1; i < powerBoss+1; i++){
if(item.col-i > 0){
closedList[item.row][item.col-i] = 8;
}
if(item.col+i < 25){
closedList[item.row][item.col+i] = 8;
}
if(item.row-i > 0){
closedList[item.row-i][item.col] = 8;
}
if(item.row+i < 13){
closedList[item.row+i][item.col] = 8;
}
}
}
}
}
// adding our starting point to Open list
let nodeOpen = new Node(null, start, new Array());
openList.push(nodeOpen);
// //Loop while openList contains some data.
while(openList.length != 0 ){
let n = openList.shift();
if(closedList[n.point.row][n.point.col] == 1) {
continue;
}
if(closedList[n.point.row][n.point.col] == 0){
while(n.parent != null){
moves.unshift(n.point);
n = n.parent;
};
break;
}
// Add current node to closedList
closedList[n.point.row][n.point.col] = 1;
//Add adjacent nodes to openList to be processed.
if(n.point.col-1 > 0){
if((closedList[n.point.row][n.point.col-1] == 0 || closedList[n.point.row][n.point.col-1] == 9) && map[n.point.row][n.point.col-1] == 0){
n.children.unshift(new Node(n,new Point(n.point.row,n.point.col-1),new Array()));
}
}
if(n.point.row+1 < 13){
if((closedList[n.point.row+1][n.point.col] == 0 || closedList[n.point.row+1][n.point.col] == 9) && map[n.point.row+1][n.point.col] == 0){
n.children.unshift(new Node(n,new Point(n.point.row+1,n.point.col),new Array()));
}
}
if(n.point.col+1 < 25){
if((closedList[n.point.row][n.point.col+1] == 0 || closedList[n.point.row][n.point.col+1] == 9) && map[n.point.row][n.point.col+1] == 0){
n.children.unshift(new Node(n,new Point(n.point.row,n.point.col+1),new Array()));
}
}
if(n.point.row-1 > 0){
if((closedList[n.point.row-1][n.point.col] == 0 || closedList[n.point.row-1][n.point.col] == 9) && map[n.point.row-1][n.point.col] == 0){
n.children.unshift(new Node(n,new Point(n.point.row - 1,n.point.col),new Array()));
}
}
for(let i = 0;i<n.children.length;i++){
openList.push(n.children[i]);
}
}
moves.unshift(start);
direction = convertMove(moves);
return direction;
}