-
Notifications
You must be signed in to change notification settings - Fork 0
/
snake_v2.py
119 lines (101 loc) · 4.23 KB
/
snake_v2.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
# SNAKES GAME
"""""
PATH PLANNING
BFS
"""""
import curses
from curses import KEY_RIGHT, KEY_LEFT, KEY_UP, KEY_DOWN #261,260,259,258
from random import randint
f= open("debug","w")
LEFT = 0; RIGHT=19;BOTTOM=0;TOP=9;
curses.initscr()
win = curses.newwin(TOP+1, RIGHT+1, 0, 0)
win.keypad(1)
curses.noecho()
curses.curs_set(0)
win.border(0)
win.nodelay(1)
key = KEY_RIGHT # Initializing values
score = 0
snake = [[4,10], [4,9], [4,8]] # Initial snake co-ordinates
food = [TOP/2,RIGHT/2] # First food co-ordinates
food = [4,17]
win.addch(food[0], food[1], '*') # Prints the food
def BFS(food,snake,key):
queue = [];
queue.append([snake,[key]]);
visited = set();
visited.add(tuple([l for k in snake for l in k]));
while queue!=[]:
state = queue.pop(0);
if (state[0][0]==food):
return state[1][1:];
moves = getMoves(food,state[0]);
for m in moves:
temp = tuple([l for k in m[0] for l in k]);
if temp not in visited:
m[1]=state[1]+m[1];
queue.append(m);
visited.add(temp);
def squareDistance(p1, p2):
return (p1[0]-p2[0])**2 + (p1[1]-p2[1])**2;
def valid(p1,snake):
return p1 not in snake and BOTTOM<p1[0]<TOP and LEFT<p1[1]<RIGHT;
def getMoves(food,snake):
head = snake[0];
tail = snake[-1];
up = [head[0]-1,head[1]];
down = [head[0]+1,head[1]];
left = [head[0],head[1]-1];
right = [head[0],head[1]+1];
#up,down,left, right;
moves = [];
if valid(up,snake):
moves.append([[up]+snake[:-1],[KEY_UP]]);
if valid(down,snake):
moves.append([[down]+snake[:-1],[KEY_DOWN]]);
if valid(left,snake):
moves.append([[left]+snake[:-1],[KEY_LEFT]]);
if valid(right,snake):
moves.append([[right]+snake[:-1],[KEY_RIGHT]]);
return moves;
while key != 27: # While Esc key is not pressed
win.border(0)
win.addstr(0, 2, 'Score : ' + str(score) + ' ') # Printing 'Score' and
win.timeout(310)
# win.timeout(150 - (len(snake)/5 + len(snake)/10)%120) # Increases the speed of Snake as its length increases
prevKey = key # Previous key pressed
moves= BFS(food,snake,prevKey);
f.write(str(moves));
for i in moves:
event = win.getch();
event = i;
key = key if event == -1 else event
if key == ord(' '): # If SPACE BAR is pressed, wait for another
key = -1 # one (Pause/Resume)
while key != ord(' '):
key = win.getch()
key = prevKey
continue
if key not in [KEY_LEFT, KEY_RIGHT, KEY_UP, KEY_DOWN, 27]: # If an invalid key is pressed
key = prevKey
# Calculates the new coordinates of the head of the snake. NOTE: len(snake) increases.
# This is taken care of later at [1].
snake.insert(0, [snake[0][0] + (key == KEY_DOWN and 1) + (key == KEY_UP and -1), snake[0][1] + (key == KEY_LEFT and -1) + (key == KEY_RIGHT and 1)])
# If snake runs over itself
if snake[0] in snake[1:] or snake[0][0] == 0 or snake[0][1] == 0 or snake[0][0] == 19 or snake[0][1] ==59: break;
if snake[0] == food: # When snake eats the food
food = []
score += 1
while food == []:
food = [randint(BOTTOM+1, TOP-1), randint(LEFT+1, RIGHT-1)] # Calculating next food's coordinates
if food in snake: food = []
win.addch(food[0], food[1], '*')
else:
last = snake.pop() # [1] If it does not eat the food, length decreases
win.addch(last[0], last[1], ' ')
win.addch(snake[0][0], snake[0][1], '#')
curses.endwin()
print("\nScore - " + str(score))
f.write("\nScore - " + str(score))
f.close()