forked from Lord-Awesome/Chris_Code_Database
-
Notifications
You must be signed in to change notification settings - Fork 0
/
start_autonomous_snake.py
361 lines (304 loc) · 18.4 KB
/
start_autonomous_snake.py
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
def start_autonomous_snake(sleep_time, wait_times, number_of_nom_noms, number_of_bombs, number_of_caffeine_pills, level_0_nom_nom, level_1_nom_nom, level_2_nom_nom, display_on_lights_boolean):
#This program creates a snake that moves around the board searching for nom-noms (represented in text by the number 99) that spawn randomly. When it eats a nom-nom, it gains length
# and the nom-nom appears somewhere else. If the snake hits a bomb (usually not visible, but can be set to display as 44), it loses length and the bomb appears somewhere else.
# The snake looks ahead 3 moves, analyzing each possible path. If it sees a nom-nom in a path, that path gains weight, with the weight value depending on how many moves away the nom-nom is.
# After analyzing all paths, it chooses the most profitable one and moves to the appropriate square. Then, the process repeats. The snake puts priority on paths that allow it to stay alive the longest.
# For example, if one path immediately leads to a nom-nom, but the snake will get trapped within the next three moves, it will prefer a path where it doesn't get stuck, as that will end the game.
# It does this by doing its phase 1 analysis on paths that won't end the game in the next three moves. If there are no such paths, then it moves to phase 2 where it does the same analysis as phase 1, but looks at all possible paths.
import random
import time
import numpy as np
import os
if display_on_lights_boolean == True:
import Adafruit_WS2801
import Adafruit_GPIO.SPI as SPI
import RPi.GPIO as GPIO
PIXEL_COUNT = 160
PIXEL_CLOCK = 11
PIXEL_DOUT = 10
pixels = Adafruit_WS2801.WS2801Pixels(PIXEL_COUNT,clk=PIXEL_CLOCK,do=PIXEL_DOUT)
pixels.clear()
pixels.show()
try:
GPIO.setmode(GPIO.BCM)
GPIO.setup(12, GPIO.OUT)
GPIO.setup(16, GPIO.OUT)
GPIO.output(16, GPIO.HIGH)
GPIO.output(12, GPIO.LOW)
except Exception as ex:
print(ex)
print("Error Encountered")
if display_on_lights_boolean == True:
nom_nom_color = Adafruit_WS2801.RGB_to_color(0,255,0) #blue
snake_body_color = Adafruit_WS2801.RGB_to_color(0,0,255) #green
snake_head_color = Adafruit_WS2801.RGB_to_color(255,0,0) #red
caffeine_pill_color = Adafruit_WS2801.RGB_to_color(255,50,255) #yellow
## Currently does not display the bombs on the lights to avoid things getting too hectic
class no_more_eligible_moves(Exception): pass
class secondary_final_move_exception(Exception): pass
#sleep_time = 0.5
#wait_times = [0.05, 0.05, 0.05, 0.05, 0.05, 0.1, 0.15, 0.2, 0.2]
#number_of_nom_noms = 2
#number_of_bombs = 5
#number_of_caffeine_pills = 5
#level_0_nom_nom = 10
#level_1_nom_nom = 7
#level_2_nom_nom = 4
snake = [[7,3],[7,4],[7,5],[7,6]]
nom_noms = [] #Extender pellets
bombs = []
caffeine_pills = []
move_count = 0
time_position = -1
hyper_mode = 0
while len(nom_noms) < number_of_nom_noms: #randomly place the nom-noms and bombs
x = random.randint(0,15)
y = random.randint(0,9)
if [x,y] not in snake and [x,y] not in nom_noms:
nom_noms.append([x,y])
while len(bombs) < number_of_bombs:
x = random.randint(0,15)
y = random.randint(0,9)
if [x,y] not in snake and [x,y] not in nom_noms and [x,y] not in bombs:
bombs.append([x,y])
while len(caffeine_pills) < number_of_caffeine_pills:
x = random.randint(0,15)
y = random.randint(0,9)
if [x,y] not in snake and [x,y] not in nom_noms and [x,y] not in bombs and [x,y] not in caffeine_pills:
caffeine_pills.append([x,y])
def caffeine_pill(time_position, hyper_mode): #makes the snake go faster for a few moves
if snake[-1] in caffeine_pills:
hyper_mode = 1
if hyper_mode == 1:
if display_on_lights_boolean == True:
GPIO.output(12,GPIO.HIGH) #comment out whichever one is blue
GPIO.output(16, GPIO.HIGH)
time_position = time_position + 1
if time_position + 1 == len(wait_times):
hyper_mode = 0
time_position = -1
return(wait_times[-1], time_position, hyper_mode)
else:
return(wait_times[time_position], time_position, hyper_mode)
else:
return(sleep_time, time_position, hyper_mode)
def print_snake():
grid = np.zeros([16,10])
for i in snake:
grid[i[0]][i[1]] = snake.index(i) + 1
for i in nom_noms:
grid[i[0]][i[1]] = 99
for i in caffeine_pills:
grid[i[0]][i[1]] = 55
for i in bombs:
grid[i[0]][i[1]] = 44
os.system("cls")
print("\n",grid,"\n")
def display_on_lights():
if display_on_lights_boolean == True:
for i in range(16):
for j in range(10):
if grid[i][j] == 99:
pixels.set_pixel((10*i)+j,nom_nom_color)
if grid[i][j] in snake and grid[i][j] != snake[-1]:
pixels.set_pixel((10*i)+j,snake_body_color)
if grid[i][j] == snake[-1]:
pixels.set_pixel((10*i)+j,snake_head_color)
if grid[i][j] == 55:
pixels.set_pixel((10*i)+j,caffeine_pill_color)
def generate_eligible_moves(snake_head, snake):
eligible_moves = []
if snake_head[0]-1 >= 0:
up_location = [snake_head[0]-1, snake_head[1]]
if up_location not in snake:
eligible_moves.append(up_location)
if snake_head[0]+1 <= 15:
down_location = [snake_head[0]+1, snake_head[1]]
if down_location not in snake:
eligible_moves.append(down_location)
if snake_head[1]+1 <= 9:
right_location = [snake_head[0],snake_head[1]+1]
if right_location not in snake:
eligible_moves.append(right_location)
if snake_head[1]-1 >= 0:
left_location = [snake_head[0],snake_head[1]-1]
if left_location not in snake:
eligible_moves.append(left_location)
return(eligible_moves)
def make_a_move():
global the_final_move
the_final_move = []
secondary_final_move = []
global eligible_moves
global biggest_value
global chosen_move
nom_nom_count = 0
new_snake_1 = []
biggest_value = 0
secondary_biggest_value = 0
new_snake_2 = []
snake_head = snake[-1]
equal_move_list = []
equal_move_secondary_list = []
eligible_moves = generate_eligible_moves(snake_head, snake) #generate all possible next moves
if len(eligible_moves) == 0:
raise no_more_eligible_moves
return
for appendage in snake: #copy snake
new_snake_1.append(appendage)
for chosen_move in eligible_moves: #for each possible move
if chosen_move in nom_noms: #if the move picks up a nom-nom, give it weight using the level_0_nom_nom value set at the top
nom_nom_count = nom_nom_count + level_0_nom_nom
new_snake_1.append(chosen_move) #update the snake
new_snake_1.remove(new_snake_1[0])
snake_head_1 = new_snake_1[-1]
eligible_moves_1 = generate_eligible_moves(snake_head_1,new_snake_1) #generate the new possible moves and repeat the process using level_1_nom_nom value
for appendage in new_snake_1: #copy snake 2
new_snake_2.append(appendage)
if len(eligible_moves_1) > 0: #So here there is a big if/else that have the same commands, except the if generates the next level of snake, while the else goes directly to picking a move
#These if/else checks are necessary because almost everything in the if loop is also in a for statement that assumes the len > 0
for chosen_move_1 in eligible_moves_1: #if the move picks up a nom-nom, give it weight using the level_1_nom_nom value (which is less than the level_0 value because it's less immediate reward)
if chosen_move_1 in nom_noms:
nom_nom_count = nom_nom_count + level_1_nom_nom
new_snake_2.append(chosen_move_1) #update the snake
new_snake_2.remove(new_snake_2[0])
snake_head_2 = new_snake_2[-1]
eligible_moves_2 = generate_eligible_moves(snake_head_2,new_snake_2)
if len(eligible_moves_2) > 0: #Here's another instance of that if/else loop. The if will update the nom_nom_count while the else goes directly to picking a move.
#These if/else checks are necessary because almost everything in the if loop is also in a for statement that assumes the len > 0
for chosen_move_2 in eligible_moves_2:
if chosen_move_2 in nom_noms:
nom_nom_count = nom_nom_count + level_2_nom_nom
eligible_move_sum = len(eligible_moves)+len(eligible_moves_1)+len(eligible_moves_2)
the_sum_that_matters = eligible_move_sum + nom_nom_count
nom_nom_count = 0
#print(chosen_move, chosen_move_1, chosen_move_2, "the_sum_that_matters: ", the_sum_that_matters)
if the_sum_that_matters >= biggest_value and len(eligible_moves_1) > 1 and len(eligible_moves_2) > 0:
if the_sum_that_matters > biggest_value and len(eligible_moves_1) > 1 and len(eligible_moves_2) > 0:
biggest_value = the_sum_that_matters
the_final_move = chosen_move
equal_move_list = []
elif the_sum_that_matters == biggest_value and len(eligible_moves_1) > 1 and len(eligible_moves_2) > 0 and chosen_move not in equal_move_list:
equal_move_list.append(chosen_move)
the_final_move = []
if the_sum_that_matters >= secondary_biggest_value:
if the_sum_that_matters > secondary_biggest_value:
secondary_biggest_value = the_sum_that_matters
secondary_final_move = chosen_move
equal_move_secondary_list = []
elif the_sum_that_matters == secondary_biggest_value and chosen_move not in equal_move_secondary_list:
equal_move_secondary_list.append(chosen_move)
else: #Remember, this is almost identical to the if statement
eligible_move_sum = len(eligible_moves)+len(eligible_moves_1)
the_sum_that_matters = eligible_move_sum + nom_nom_count
nom_nom_count = 0
if the_sum_that_matters >= biggest_value and len(eligible_moves_1) > 1 and len(eligible_moves_2) > 0:
if the_sum_that_matters > biggest_value and len(eligible_moves_1) > 1 and len(eligible_moves_2) > 0:
biggest_value = the_sum_that_matters
the_final_move = chosen_move
equal_move_list = []
elif the_sum_that_matters == biggest_value and len(eligible_moves_1) > 1 and len(eligible_moves_2) > 0 and chosen_move not in equal_move_list:
equal_move_list.append(chosen_move)
the_final_move = []
if the_sum_that_matters >= secondary_biggest_value:
if the_sum_that_matters > secondary_biggest_value:
secondary_biggest_value = the_sum_that_matters
secondary_final_move = chosen_move
equal_move_secondary_list = []
elif the_sum_that_matters == secondary_biggest_value and chosen_move not in equal_move_secondary_list:
equal_move_secondary_list.append(chosen_move)
else: #Remember, this is almost identical to the if statement
eligible_move_sum = len(eligible_moves)
the_sum_that_matters = eligible_move_sum + nom_nom_count
nom_nom_count = 0
if the_sum_that_matters >= biggest_value and len(eligible_moves_1) > 1 and len(eligible_moves_2) > 0:
if the_sum_that_matters > biggest_value and len(eligible_moves_1) > 1 and len(eligible_moves_2) > 0:
biggest_value = the_sum_that_matters
the_final_move = chosen_move
equal_move_list = []
elif the_sum_that_matters == biggest_value and len(eligible_moves_1) > 1 and len(eligible_moves_2) > 0 and chosen_move not in equal_move_list:
equal_move_list.append(chosen_move)
the_final_move = []
if the_sum_that_matters >= secondary_biggest_value:
if the_sum_that_matters > secondary_biggest_value:
secondary_biggest_value = the_sum_that_matters
secondary_final_move = chosen_move
equal_move_secondary_list = []
elif the_sum_that_matters == secondary_biggest_value and chosen_move not in equal_move_secondary_list:
equal_move_secondary_list.append(chosen_move)
if len(equal_move_list) > 0:
if len(equal_move_list) > 1:
the_final_move = equal_move_list[random.randint(0,len(equal_move_list)-1)]
else:
the_final_move = equal_move_list[0]
if the_final_move == [] and len(equal_move_list) == 0 and len(equal_move_secondary_list) > 0:
if len(equal_move_secondary_list) > 1:
the_final_move = equal_move_secondary_list[random.randint(0,len(equal_move_secondary_list)-1)]
else:
the_final_move = equal_move_secondary_list[0]
if the_final_move == []: #if we keep failing this check: if the_sum_that_matters > biggest_value and len(eligible_moves_1) > 1 and len(eligible_moves_2) > 0
#... then the_final_move will never get assigned. Secondary_final_move will be assigned in this case, and here we set it to the_final_move
the_final_move = secondary_final_move
return(the_final_move)
#------------------------------------------------------------------------------------START THE GAME -------------------------------------------------
print("Starting snake:")
print_snake()
time.sleep(sleep_time)
#------------------------------------------------------------------------------------- THE BIG LOOP -----------------------------------------------------
while 1:
move_count = move_count + 1
if len(snake) == 0:
print("Snake is dead :(")
break
try:
chosen_move = make_a_move() #This will check to make sure we don't get in trouble but it won't generate a queue so we could forecase one path but then follow another
except no_more_eligible_moves:
print_snake()
print("\n No more eligible moves")
break
except secondary_final_move_exception:
print_snake()
print("\n Secondary final move = []")
print(the_final_move)
print(chosen_move)
break
snake.append(chosen_move)
if chosen_move not in nom_noms:
snake.remove(snake[0])
if chosen_move in nom_noms:
nom_noms.remove(chosen_move)
while len(nom_noms) < number_of_nom_noms:
x = random.randint(0,15)
y = random.randint(0,9)
if [x,y] not in snake and [x,y] not in nom_noms and [x,y] not in eligible_moves:
nom_noms.append([x,y])
if chosen_move in bombs:
if display_on_lights_boolean == True:
GPIO.output(12,GPIO.HIGH)
GPIO.output(16, GPIO.HIGH) #Comment out whichever one is yellow
snake.remove(snake[-1])
bombs.remove(chosen_move)
while len(bombs) < number_of_bombs:
x = random.randint(0,15)
y = random.randint(0,9)
if [x,y] not in snake and [x,y] not in nom_noms and [x,y] not in bombs and [x,y] not in eligible_moves:
bombs.append([x,y])
[rest_time, time_position_from_function, hyper_mode_from_function] = caffeine_pill(time_position, hyper_mode)
time_position = time_position_from_function
hyper_mode = hyper_mode_from_function
if chosen_move in caffeine_pills:
caffeine_pills.remove(chosen_move)
while len(caffeine_pills) < number_of_caffeine_pills:
x = random.randint(0,15)
y = random.randint(0,9)
if [x,y] not in snake and [x,y] not in nom_noms and [x,y] not in eligible_moves and [x,y] not in caffeine_pills:
caffeine_pills.append([x,y])
print_snake()
if display_on_lights_boolean == True:
display_on_lights()
time.sleep(rest_time)
if display_on_lights_boolean == True:
GPIO.output(12,GPIO.LOW)
GPIO.output(16, GPIO.LOW)
print("Number of moves: ", move_count)
input("")