forked from regression1607/python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2048 game in python.py
More file actions
172 lines (102 loc) · 2.51 KB
/
2048 game in python.py
File metadata and controls
172 lines (102 loc) · 2.51 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
import random
def start_game():
mat =[]
for i in range(4):
mat.append([0] * 4)
# printing controls for user
print("Commands are as follows : ")
print("'W' or 'w' : Move Up")
print("'S' or 's' : Move Down")
print("'A' or 'a' : Move Left")
print("'D' or 'd' : Move Right")
add_new_2(mat)
return mat
r = random.randint(0, 3)
c = random.randint(0, 3)
while(mat[r] != 0):
r = random.randint(0, 3)
c = random.randint(0, 3)
mat[r] = 2
=
def get_current_state(mat):
# if any cell contains
# 2048 we have won
for i in range(4):
for j in range(4):
if(mat[i][j]== 2048):
return 'WON'
for i in range(4):
for j in range(4):
if(mat[i][j]== 0):
return 'GAME NOT OVER'
for i in range(3):
for j in range(3):
if(mat[i][j]== mat[i + 1][j] or mat[i][j]== mat[i][j + 1]):
return 'GAME NOT OVER'
for j in range(3):
if(mat[3][j]== mat[3][j + 1]):
return 'GAME NOT OVER'
for i in range(3):
if(mat[i][3]== mat[i + 1][3]):
return 'GAME NOT OVER'
# else we have lost the game
return 'LOST'
def compress(mat):
changed = False
new_mat = []
for i in range(4):
new_mat.append([0] * 4)
for i in range(4):
pos = 0
for j in range(4):
if(mat[i][j] != 0):
new_mat[i][pos] = mat[i][j]
if(j != pos):
changed = True
pos += 1
return new_mat, changed
def merge(mat):
changed = False
for i in range(4):
for j in range(3):
if(mat[i][j] == mat[i][j + 1] and mat[i][j] != 0):
mat[i][j] = mat[i][j] * 2
mat[i][j + 1] = 0
changed = True
return mat, changed
def reverse(mat):
new_mat =[]
for i in range(4):
new_mat.append([])
for j in range(4):
new_mat[i].append(mat[i][3 - j])
return new_mat
def transpose(mat):
new_mat = []
for i in range(4):
new_mat.append([])
for j in range(4):
new_mat[i].append(mat[j][i])
return new_mat
def move_left(grid):
new_grid, changed1 = compress(grid)
new_grid, changed2 = merge(new_grid)
changed = changed1 or changed2
new_grid, temp = compress(new_grid)
return new_grid, changed
def move_right(grid):
new_grid = reverse(grid)
new_grid, changed = move_left(new_grid)
new_grid = reverse(new_grid)
return new_grid, changed
# function to update the matrix
def move_up(grid):
new_grid = transpose(grid)
new_grid, changed = move_left(new_grid)
new_grid = transpose(new_grid)
return new_grid, changed
def move_down(grid):
new_grid = transpose(grid)
new_grid, changed = move_right(new_grid)
new_grid = transpose(new_grid)
return new_grid, changed