summaryrefslogtreecommitdiff
path: root/2048.py
blob: 3de8fe29dbfd109bbb7ad6672161296b51ce928d (plain)
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
import random
import time
import sys

arr = [[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]]


def show():
    out = "\n"
    for i in arr:
        for j in i:
            out += str(j)
            out += "\t"
        out += "\n\n"
    out += "----------------------------\n"
    print(out)


def generate():
    empty = []
    flag = 0
    for i in range(4):
        for j in range(4):
            if arr[i][j] == 0:
                empty.append([i, j])
            elif arr[i][j] == 2048:
                flag = 1
    if flag:
        return 2
    elif len(empty) == 0:
        return 1
    else:
        pos = random.choice(empty)
        arr[pos[0]][pos[1]] = random.choice([2, 2, 4])
        return 0
            

def moveleft():
    for i in range(4): 
        i2 = [0] + arr[i]
        tmp = []
        lastitem = 0
        for j in range(1, 5):
            if i2[j] != 0:  
                if i2[j] != lastitem:
                    tmp.append(i2[j])
                    lastitem = i2[j]
                else:
                    tmp[-1] *= 2
                    lastitem = 0
        for k in range(4 - len(tmp)):
            tmp.append(0)
        arr[i] = tmp


def moveright():
    for i in range(4): 
        i2 = arr[i] + [0]
        tmp = []
        lastitem = 0
        for j in range(3, -1, -1):
            if i2[j] != 0: 
                if i2[j] != lastitem:
                    tmp = [i2[j]] + tmp
                    lastitem = i2[j]
                else:
                    tmp[0] *= 2
                    lastitem = 0
        for k in range(4 - len(tmp)):
            tmp = [0] + tmp
        arr[i] = tmp

def moveup():
    for i in range(4): 
        i2 = []
        tmp = []
        lastitem = 0
        for j in arr:
            i2.append(j[i])
        i2 = [0] + i2
        for j in range(1, 5):
            if i2[j] != 0:  
                if i2[j] != lastitem:
                    tmp.append(i2[j])
                    lastitem = i2[j]
                else:
                    tmp[-1] *= 2
                    lastitem = 0
        for k in range(4 - len(tmp)):
            tmp.append(0)
        for j in range(4):
            arr[j][i] = tmp[j]

def movedown():
    for i in range(4): 
        i2 = []
        tmp = []
        lastitem = 0
        for j in arr:
            i2.append(j[i])
        i2 = i2 + [0]
        for j in range(3, -1, -1):
            if i2[j] != 0:  
                if i2[j] != lastitem:
                    tmp = [i2[j]] + tmp
                    lastitem = i2[j]
                else:
                    tmp[0] *= 2
                    lastitem = 0
        for k in range(4 - len(tmp)):
            tmp = [0] + tmp
        for j in range(4):
            arr[j][i] = tmp[j]

def move():
    action = input("Action (W, A, S, D): ").lower()
    if action == "w":
        moveup()
    elif action == "a":
           moveleft()
    elif action == "s":
        movedown()
    elif action == "d":
        moveright()
    else:
        print("Invalid Input")
        move()


generate()
show()
sys.setrecursionlimit(1)

while True:
    try:
        move()
    except RecursionError:
        print("Too much wrong attempts! You lost\n")
        break
    x = generate()
    if x == 2:
        show()
        print("You Won\n")
        break
    elif x:
        show()
        print("You lost\n")
        break
    else:
        show()