-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAI.cpp
183 lines (176 loc) · 3.67 KB
/
AI.cpp
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
#include"snake.h"
//11.86 1500 50
//转角问题
int TrunSnake_byAlpha(struct SnakeMap* map, struct SnakeRelevant* Data) {
int result = Data->tempdir;
int next = map[Data->head + Data->tempdir].Direction;
int x = Data->x_FoodHead;
int y = Data->y_FoodHead;
int z = x + y;
if (y == 0)
result = x > 0 ? right : left;
if (x == 0)
result = y > 0 ? up : down;
Data->tempdir = result;
if (!CheakSnakeSafety())
switch (Data->condition)
{
case 1:
return right;
case 2:
return down;
case 3:
result = z > 0 ? right : down;
break;
case 4:
return up;
case 5:
result = x > y ? right : up;
break;
case 6:
result = y < 0 ? down : up;
break;
case 7:
if (y > 0 && y > x)
result = up;
else if (y < 0 && z < 0)
result = down;
else
result = right;
break;
case 8:
return left;
case 9:
result = x > 0 ? right : left;
break;
case 10:
result = x > y ? down : left;
break;
case 11:
if (x > 0 && z > 0)
result = right;
else if (x < 0 && y > x)
result = left;
else
result = down;
break;
case 12:
result = z > 0 ? up : left;
break;
case 13:
if (x > 0 && x > y)
result = right;
else if (x < 0 && z < 0)
result = left;
else
result = up;
break;
case 14:
if (y > 0 && z > 0)
result = up;
else if (y < 0 && x > y)
result = down;
else
result = left;
break;
}
Data->tempdir = result;
if (CheakHtoTFSafety(Data->food, 0)) {
if (CheakHtoTFSafety(Data->tail, Data->tempdir))
return result;
else
return fnFarthestToTheSnakeFood_A(Data);
}
else
return fnFarthestToTheSnakeTail(Data);
}
int fnFarthestToTheSnakeFood_A(SnakeRelevant* Data)
{
int result = 0;
switch (Data->condition)
{
case 1:
result = right;
break;
case 2:
result = down;
break;
case 3:
result = Data->tempdir == down ? right : down;
break;
case 4:
result = up;
break;
case 5:
result = Data->tempdir == up ? right : up;
break;
case 6:
result = Data->tempdir == up ? down : up;
break;
case 7:
if (Data->tempdir == right)
result = CheakHtoTFSafety(Data->tail, up) ? up : down;
else
result = Data->tempdir == up ? down : up;
break;
case 8:
result = left;
break;
case 9:
result = Data->tempdir == left ? right : left;
break;
case 10:
result = Data->tempdir == left ? down : left;
break;
case 11:
if (Data->tempdir == down)
result = CheakHtoTFSafety(Data->tail, right) ? right : left;
else
result = Data->tempdir == right ? left : right;
break;
case 12:
result = Data->tempdir == left ? up : left;
break;
case 13:
if (Data->tempdir == up)
result = CheakHtoTFSafety(Data->tail, left) ? left : right;
else
result = Data->tempdir == left ? right : left;
break;
case 14:
if (Data->tempdir == left)
result = CheakHtoTFSafety(Data->tail, up) ? up : down;
else
result = Data->tempdir == up ? down : up;
break;
}
return result;
}
int fnFarthestToTheSnakeFood_B(SnakeRelevant* Data)
{
int Dir[4] = { left,right,up,down };
int result = Data->tempdir;
int max = 0, temp = 0;
for (int i = 0; i < 4; i++) {
temp = CheakHtoTFSafety(Data->food, Dir[i]);
if (temp >= max) {
max = temp;
result = Dir[i];
}
}
return result;
}
int fnFarthestToTheSnakeTail(SnakeRelevant* Data)
{
int Dir[4] = { left,right,up,down };
int result = Data->tempdir;
int max = 0, temp = 0;
for (int i = 0; i < 4; i++) {
temp = CheakHtoTFSafety(Data->tail, Dir[i]);
if (temp >= max) {
max = temp;
result = Dir[i];
}
}
return result;
}