python 小游戏《2048》字符版非图形界面

参考链接： 闲谈2048小游戏和数组的旋转及翻转和转置

目录

2048 

一、方阵类

二、随机插入1或2

三、 合并和递增

四、 判断和移动

五、 键盘控制

完整源代码

玩法过程

---

2048 

上回说到2048小游戏中数组的各种旋转、翻转的方法，就是为代码编程作准备的；有了这些再就加上二维数组各行列上元素的合并、能否被合并的判断、成功失败的判断等等；以及再加上键盘按键的控制，小游戏就基本完成了。

一、方阵类

方阵就是高宽相同的矩阵，2048用方阵就行了，写代码也省事一点，方阵的类如下：

>>> from random import sample
>>> class Matrix:
...     def __init__(self, order=4):
...         self.order = order
...         self.matrix = self.new()
...     def __repr__(self):
...         m, n = [], len(str(2**max(sum(self.matrix,[]))))
...         for mat in self.matrix:
...             m.append(', '.join(f'{2**x if x else 0:>{n}}' for x in mat))
...         return '],\n ['.join(m).join(['[[',']]'])
...     def new(self):
...         n = self.order
...         m = sample([0]*(n*n-2)+sample([0,1,1],2),n*n)
...         return  [m[i*n:i*n+n] for i in range(n)]
... 
...     
>>> Matrix()
[[0, 0, 2, 0],
 [0, 0, 0, 0],
 [0, 0, 2, 0],
 [0, 0, 0, 0]]
>>> Matrix()
[[0, 0, 0, 0],
 [0, 0, 0, 0],
 [0, 0, 2, 0],
 [0, 0, 0, 0]]

在方阵中随机产生1~2个1，sample([0,1,1],2) 生成的1个还是2个，比例为2:1；

在__repr__方法中显示时，这些1作为2的指数，所以显示为2^1=2。

二、随机插入数字

    def insert(self):
        n = self.order
        m = [i for i,n in enumerate(sum(self.matrix,[])) if not n]
        if m:
            i = sample(m, 1)[0]
            self.matrix[i//n][i%n] = sum(sample([1,1,1,2],1))

或者：

    def insert(self):
        n = self.order
        m = [(i,j) for j in range(n) for i in range(n) if not self.matrix[i][j]]
        if m:
            i, j = sample(m, 1)[0]
            self.matrix[i][j] = sum(sample([1,1,1,2],1))

为加快数字的拼合速度，从5队开始，除了只插入1和2，可以考虑加入更大的数字：

self.matrix[i][j] = sum(sample([1,1,1,2]*3+([1,2,3,3]+[i for i in range(n+4,n,-1)] if n>4 else []),1))

如 n = 5 时，拟插入的各数字比例为：

>>> n = 5
>>> t = [1,1,1,2]*3+[1,2,3,3]+[i for i in range(n+4,n,-1)]
>>> for i in set(t):
...     print([i,t.count(i)/20])
... 
...     
[1, 0.5]
[2, 0.2]
[3, 0.1]
[6, 0.05]
[7, 0.05]
[8, 0.05]
[9, 0.05] 

三、 合并和递增

   ......     
   for i,array in enumerate(self.matrix):
            self.matrix[i] = Matrix.update(array)
    ......
    def update(array):
        split = lambda a: [_ for _ in a if _]+[_ for _ in a if not _]
        array = split(array)
        for i,a in enumerate(array):
            if i and a and a==array[i-1]:
                array[i-1] += 1
                array[i] = 0
        return split(array)

四、 判断和移动

略……写得有点复杂，可以到完整代码中阅读。

五、 键盘控制

引入keyboard库控制键盘，示例如下：

1. import keyboard
3. def keys0():
4. print("Left key pressed")
6. def keys1():
7. print("Right key pressed")
9. def keys2():
10. print("Up key pressed")
12. def keys3():
13. print("Down key pressed")
15. def restart():
16. print("Enter key pressed")
18. # 添加热键
19. keyboard.add_hotkey('left', keys0)
20. keyboard.add_hotkey('right', keys1)
21. keyboard.add_hotkey('up', keys2)
22. keyboard.add_hotkey('down', keys3)
23. keyboard.add_hotkey('enter', restart)
25. # 等待用户按下esc键
26. print("Waiting for ESC to exit...")
27. keyboard.wait('esc')
29. # 在这里移除所有热键
30. print("Removing all hotkeys...")
31. keyboard.unhook_all_hotkeys()

Waiting for ESC to exit...
Left key pressed
Right key pressed
Up key pressed
Down key pressed
Enter key pressed
Removing all hotkeys...
>>> 

注：最后一行代码keyboard.unhook_all_hotkeys()很关键，一定都有否则即使按了ESC键退出程序，热键还是驻留在内存里，键盘还会响应keyboard.add_hotkey()添加的热键。

---

完整源代码

1. import keyboard
2. from random import sample
4. class Matrix:
5. def __init__(self, order=4):
6. self.over = False
7. self.order = order
8. self.matrix = self.new()
9. self.victory = False
10. def __repr__(self):
11. m, n = [], len(str(2**max(sum(self.matrix,[]))))
12. for mat in self.matrix:
13. m.append(', '.join(f'{2**x if x else 0:>{n}}' for x in mat))
14. return '],\n ['.join(m).join(['[[',']]'])
15. def new(self):
16. n = self.order
17. m = sample([0]*(n*n-2)+sample([0,1,1],2),n*n)
18. return [m[i*n:i*n+n] for i in range(n)]
19. def show(self):
20. if self.over or self.victory:
21. print('Enter to restart...')
22. else:
23. print(self)
24. print()
25. def insert(self):
26. n = self.order
27. m = [(i,j) for j in range(n) for i in range(n) if not self.matrix[i][j]]
28. if m:
29. i, j = sample(m, 1)[0]
30. self.matrix[i][j] = sum(sample([1,1,1,2],1))
31. def full(self):
32. return all(sum(self.matrix,[]))
33. def move(self, direction=0):
34. if self.over or self.victory: return
35. direction %= 4
36. if direction == 0: #left
37. if self.cannotmove(0): return
38. elif direction == 1: #right
39. if self.cannotmove(1): return
40. self.matrix = self.flipH()
41. elif direction == 2: #up
42. if self.cannotmove(2): return
43. self.matrix = self.rotL()
44. elif direction == 3: #down
45. if self.cannotmove(3): return
46. self.matrix = self.rotR()
47. for i,array in enumerate(self.matrix):
48. self.matrix[i] = Matrix.update(array)
49. if direction == 1:
50. self.matrix = self.flipH()
51. elif direction == 2:
52. self.matrix = self.rotR()
53. elif direction == 3:
54. self.matrix = self.rotL()
55. indexmax = max(sum(self.matrix,[]))
56. if self.order==2 and indexmax==4 or self.order==3 and indexmax==7 or indexmax==self.order+7:
57. self.victory = True
58. print(self)
59. print('Win! Enter to restart...')
60. return
61. self.insert()
62. self.over = self.cannotmove()
63. if self.over:
64. print(self)
65. print('Gave over!')
66. def cannotmove(self, direction = 4):
67. m, n = self.matrix, self.rotR()
68. p, q = self.rotL(), self.flipH()
69. if direction==0:
70. return all(n[0]) and Matrix.cannotupdate(m)
71. elif direction==1:
72. return all(n[-1]) and Matrix.cannotupdate(q)
73. elif direction==2:
74. return all(m[0]) and Matrix.cannotupdate(n)
75. elif direction==3:
76. return all(m[-1]) and Matrix.cannotupdate(p)
77. else:
78. return (self.full() and self.cannotmove(0) and self.cannotmove(1)
79. and self.cannotmove(2) and self.cannotmove(3))
80. def cannotupdate(matrix):
81. return all([m==Matrix.update(m) for m in matrix])
82. def update(array):
83. split = lambda a: [_ for _ in a if _]+[_ for _ in a if not _]
84. array = split(array)
85. for i,a in enumerate(array):
86. if i and a and a==array[i-1]:
87. array[i-1] += 1
88. array[i] = 0
89. return split(array)
90. def flipH(self):
91. m, n = self.matrix, self.order
92. return [[m[i][n-j-1] for j in range(n)] for i in range(n)]
93. def flipV(self):
94. m, n = self.matrix, self.order
95. return [[m[n-j-1][i] for i in range(n)] for j in range(n)]
96. def rotL(self):
97. m, n = self.matrix, self.order
98. return [[m[j][n-i-1] for j in range(n)] for i in range(n)]
99. def rotR(self):
100. m, n = self.matrix, self.order
101. return [[m[n-j-1][i] for j in range(n)] for i in range(n)]
103. def move(i):
104. mat.move(i)
105. mat.show()
106. def keys0():
107. move(0)
108. def keys1():
109. move(1)
110. def keys2():
111. move(2)
112. def keys3():
113. move(3)
114. def restart():
115. global mat
116. if mat.victory:
117. mat.order += 1
118. mat = Matrix(mat.order)
119. mat.show()
120. if mat.over:
121. if mat.order>3:
122. mat.order -= 1
123. mat = Matrix(mat.order)
124. mat.show()
126. if __name__ == '__main__':
127. print("《2048小游戏》")
128. print("上下左右前头控制方向，按ESC退出...")
129. mat = Matrix(2)
130. mat.show()
131. keyboard.add_hotkey('left', keys0)
132. keyboard.add_hotkey('right', keys1)
133. keyboard.add_hotkey('up', keys2)
134. keyboard.add_hotkey('down', keys3)
135. keyboard.add_hotkey('enter', restart)
136. keyboard.wait('esc') # 等待用户按下esc键退出
137. print('bye!')
138. keyboard.unhook_all_hotkeys() # 退出后移除所有热键

玩法过程

《2048小游戏》
上下左右前头控制方向，按ESC退出...
[[0, 0],
 [0, 2]]

[[0, 0],
 [2, 2]]

[[0, 4],
 [0, 4]]

[[0, 2],
 [0, 8]]

[[2, 2],
 [8, 0]]

[[4, 2],
 [8, 0]]

[[4, 4],
 [8, 2]]

[[8, 2],
 [8, 2]]

[[ 0,  0],
 [16,  4]]
Win! Enter to restart...
Enter to restart...
[[0, 2, 0],
 [0, 0, 2],
 [0, 0, 0]]

[[0, 0, 0],
 [2, 0, 0],
 [0, 2, 2]]

[[4, 0, 0],
 [0, 0, 2],
 [0, 0, 4]]

[[0, 2, 0],
 [0, 0, 2],
 [4, 0, 4]]

[[0, 0, 2],
 [0, 0, 2],
 [4, 0, 8]]

[[0, 0, 2],
 [0, 2, 2],
 [0, 4, 8]]

[[0, 0, 0],
 [0, 2, 4],
 [2, 4, 8]]

[[2, 0, 0],
 [2, 4, 0],
 [2, 4, 8]]

[[2, 0, 0],
 [2, 0, 0],
 [4, 8, 8]]

[[ 0,  2,  2],
 [ 0,  0,  2],
 [ 0,  4, 16]]

[[ 0,  0,  0],
 [ 2,  2,  4],
 [ 0,  4, 16]]

[[ 0,  0,  0],
 [ 0,  4,  4],
 [ 4,  4, 16]]

[[ 2,  0,  0],
 [ 0,  0,  4],
 [ 4,  8, 16]]

[[ 2,  0,  0],
 [ 2,  0,  4],
 [ 4,  8, 16]]

[[ 2,  0,  0],
 [ 4,  0,  4],
 [ 4,  8, 16]]

[[ 0,  4,  0],
 [ 2,  0,  4],
 [ 8,  8, 16]]

[[ 0,  2,  4],
 [ 0,  2,  4],
 [ 0, 16, 16]]

[[ 2,  2,  4],
 [ 0,  2,  4],
 [ 0,  0, 32]]

[[ 0,  0,  0],
 [ 2,  0,  8],
 [ 2,  4, 32]]

[[ 0,  0,  0],
 [ 2,  0,  8],
 [ 4,  4, 32]]

[[ 0,  0,  2],
 [ 0,  2,  8],
 [ 0,  8, 32]]

[[ 0,  0,  2],
 [ 0,  2,  8],
 [ 2,  8, 32]]

[[ 2,  0,  4],
 [ 2,  8,  0],
 [ 2,  8, 32]]

[[ 0,  0,  2],
 [ 2,  0,  4],
 [ 4, 16, 32]]

[[ 2,  0,  2],
 [ 2,  4,  0],
 [ 4, 16, 32]]

[[ 0,  0,  4],
 [ 4,  4,  2],
 [ 4, 16, 32]]

[[ 2,  0,  4],
 [ 0,  4,  2],
 [ 8, 16, 32]]

[[ 2,  2,  4],
 [ 0,  4,  2],
 [ 8, 16, 32]]

[[ 0,  4,  4],
 [ 2,  4,  2],
 [ 8, 16, 32]]

[[ 2,  0,  4],
 [ 2,  8,  2],
 [ 8, 16, 32]]

[[ 0,  2,  4],
 [ 4,  8,  2],
 [ 8, 16, 32]]

[[ 2,  4,  2],
 [ 4,  8,  2],
 [ 8, 16, 32]]

[[ 2,  4,  2],
 [ 4,  8,  4],
 [ 8, 16, 32]]
Gave over!
Enter to restart...

注：二阶方阵玩出16就过关，三阶方阵玩出128就过关，四阶就要到2048才能过关，五阶则要到4096才过关，六阶以上类推。演示时玩到三阶方阵就over了，如果三阶方阵过关会自动升级到四阶方阵，以此类推。

---

本文完