python實現小遊戲2048
阿新 • • 發佈:2019-01-07
一、原始碼
import curses from itertools import chain from random import choice class GameField(object): # 初始化資訊 def __init__(self, width=4, height=4, win_value=2048): self.width = width self.height = height self.win_value = win_value self.score = 0 # 當前得分 self.highscore = 0 # 最高分 self.moves = {} self.moves['Left'] = self.is_move_left self.moves['Right'] = self.is_move_right self.moves['Down'] = self.is_move_down self.moves['Up'] = self.is_move_up self.movesDict = {} self.movesDict['Left'] = self.move_left self.movesDict['Right'] = self.move_right self.movesDict['Down'] = self.move_down self.movesDict['Up'] = self.move_up def reset(self): # 重置棋盤 if self.score > self.highscore: self.highscore = self.score # 更新最高分 self.score = 0 # 需求1: 生成4*4的棋盤, 其中資料結構選擇列表巢狀列表; self.field = [[0 for j in range(self.width)] for i in range(self.height)] # 在棋盤的一個隨機位置插入一個數字2或者4 self.random_create() self.random_create() def random_create(self): # 在棋盤的一個隨機位置插入一個數字2或者4 # field[0][3] = 2 while True: i, j = choice(range(self.height)), choice(range(self.width)) if self.field[i][j] == 0: self.field[i][j] = choice([2, 2, 2, 4]) break def draw(self, stdscr): def draw_sep(): stdscr.addstr('+' + "-----+" * self.width + '\n') def draw_one_row(row): stdscr.addstr("".join('|{:^5}'.format(num) if num != 0 else "| " for num in row) + '|' + '\n') # 清屏 stdscr.clear() stdscr.addstr("2048".center(50, '-') + '\n') stdscr.addstr("當前分數:" + str(self.score) + '\n') if self.highscore != 0: stdscr.addstr("最高分:" + str(self.highscore) + '\n') for row in self.field: draw_sep() draw_one_row(row) draw_sep() # 判斷是否贏或者輸 if self.is_win(): stdscr.addstr("勝利!!!!" + '\n') if self.is_gameover(): stdscr.addstr("遊戲結束!!!!" + '\n') stdscr.addstr(" 遊戲幫助: 上下左右鍵 (R)Restart Q(Quit)") def is_win(self): return max(chain(*self.field)) >= self.win_value def is_gameover(self): # 任何方向都不能移動的時候, 遊戲結束 return not any([self.move_is_possible(direction) for direction in self.moves]) @staticmethod def invert(field): # 矩陣進行反轉 return [row[::-1] for row in field] # print(invert(li)) @staticmethod # 矩陣的轉置 def transpose(field): return [list(row) for row in zip(*field)] @staticmethod def is_row_change(row): # row # 需求3. 判斷一行內容是否可移動。 def is_change(i): # 0 # 判斷每兩個元素之間是否可移動 if row[i] == 0 and row[i + 1] != 0: return True if row[i] != 0 and row[i] == row[i + 1]: return True return False return any([is_change(index) for index in range(len(row) - 1)]) # 判斷這個棋盤是否可向左移動 def is_move_left(self, field): return any([self.is_row_change(row) for row in field]) def is_move_right(self, field): # 對於列表元素進行反轉 field = self.invert(field) print(field) return self.is_move_left(field) def is_move_up(self, field): # 對於列表元素進行轉置 field = self.transpose(field) return self.is_move_left(field) def is_move_down(self, field): # 反轉+ 轉置 field = self.transpose(field) return self.is_move_right(field) def move_is_possible(self, direction): # 'left' # 判斷使用者選擇的方向是否可移動 if direction in self.moves: return self.moves[direction](self.field) else: return False # 將棋盤每一行的非0數向前移動, 0向後移動; @staticmethod def tight(row): # [2, 0, 2, 0] # 最快的方式, 通過排序實現........... return sorted(row, key=lambda x: 1 if x == 0 else 0) def merge(self, row): # [2,2,0,0] # [0,1,2] for i in range(len(row) - 1): # 如果兩個值相等, 前一個元素*2, 後一個元素改為0。 if row[i] == row[i + 1]: row[i] *= 2 row[i + 1] = 0 # 如果覆蓋成功, 就給得分 self.score += row[i] return row # [4, 0, 0, 0] def move_row_left(self, row): return self.tight(self.merge(self.tight(row))) def move_left(self, field): return [self.move_row_left(row) for row in field] def move_right(self, field): field = self.invert(field) return self.invert([self.move_row_left(row) for row in field]) def move_up(self, field): return self.transpose([self.move_row_left(row) for row in self.transpose(field)]) def move_down(self, field): return self.invert(self.transpose([self.move_row_left(row) for row in self.invert(self.transpose(field))])) def move(self, direction): # 'left' # 判斷使用者選擇的方向是否可移動 if direction in self.movesDict: # 判斷是否可移動 if self.move_is_possible(direction): self.field = self.movesDict[direction](self.field) self.random_create() return True else: return False def get_user_action(stdscr): action = stdscr.getch() if action == curses.KEY_UP: return 'Up' if action == curses.KEY_DOWN: return 'Down' if action == curses.KEY_LEFT: return 'Left' if action == curses.KEY_RIGHT: return 'Right' if action == ord('r'): return 'Restart' if action == ord('q'): return 'Exit' def main(stdscr): action = stdscr.getch() def init(): # 初始化棋盤的操作 game_field.reset() game_field.draw(stdscr) return 'Game' def game(): game_field.draw(stdscr) action = get_user_action(stdscr) if action == 'Restart': return 'Init' if action == 'Exit': return 'Exit' if game_field.move(action): if game_field.is_win(): return 'Win' if game_field.is_gameover(): return 'GameOver' return 'Game' def not_game(): game_field.draw(stdscr) while True: action = get_user_action(stdscr) if action == 'Restart': return 'Init' if action == 'Exit': return 'Exit' state_actions = { 'Init': init, 'Game': game, 'Win': not_game, 'GameOver': not_game, } game_field = GameField() state = 'Init' # 如果當前狀態不是退出, 那麼一直執行 while state != 'Exit': # 執行當前狀態需要操作的內容, 並返回, 下一次的狀態為什麼. state = state_actions[state]() curses.wrapper(main)
二、ModuleNotFoundError: No module named '_curses'
ModuleNotFoundError: No module named '_curses',根本原因 是 curses 庫不支援 windows。要解決這個問題,我們就需要使用一個 unofficial curses(非官方curses庫)來代替 python 自帶的curses庫。也就是 whl 包。
https://www.lfd.uci.edu/~gohlke/pythonlibs/#curses
找到匹配的python版本的下載,之後在cmd中使用
pip install curses‑2.2‑cp36‑cp36m‑win_amd64.whl
安裝。
三、Redirection is not supported
Redirection is not supported即不支援轉向。
在cmd中輸入:
python game_2048.py