200行Python代码实现2048

2024-03-02 21:30
文章标签 python 代码 实现 200 2048

本文主要是介绍200行Python代码实现2048,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!

200行Python代码实现2048

2048原版游戏地址:http://gabrielecirulli.github.io/2048
创造游戏文件2048.py
首先导入需要的包:

import curses
from random import randrange, choice
from collections import defaultdict

1.主逻辑

1.1 用户行为

所有的有效输入都可以转换为”上,下,左,右,游戏重置,退出”这六种行为,用 actions 表示

actions = ['Up', 'Left', 'Down', 'Right', 'Restart', 'Exit']

有效输入键是最常见的 W(上),A(左),S(下),D(右),R(重置),Q(退出),这里要考虑到大写键开启的情况,获得有效键值列表:

letter_codes = [ord(ch) for ch in 'WASDRQwasdrq']

将输入与行为进行关联:

actions_dict = dict(zip(letter_codes, actions * 2))
1.2 状态机

处理游戏主逻辑的时候我们会用到一种十分常用的技术:状态机,或者更准确的说是有限状态机(FSM)

你会发现 2048 游戏很容易就能分解成几种状态的转换。
image
state存储当前状态,state_actions这个词典变量作为状态转换的规则,它的key是状态,value是返回下一个状态的函数:

  • Init:init()
    • Game
  • Game:game()
    • Game
    • Win
    • GameOver
    • Exit
  • Win:lambda:not_game(‘Win’)
    • Init
    • Exit
  • Gameover:lambda:not_game(‘Gameover’)
    • Init
    • Exit
  • Exit:退出循环

状态机会不断循环,直到达到 Exit 终结状态结束程序。

下面是经过提取的主逻辑的代码,会在后面进行补全:

def main(stdscr):def init():#重置游戏棋盘return 'Game'def not_game(state):#画出 GameOver 或者 Win 的界面#读取用户输入得到action,判断是重启游戏还是结束游戏responses = defaultdict(lambda: state) #默认是当前状态,没有行为就会一直在当前界面循环responses['Restart'], responses['Exit'] = 'Init', 'Exit' #对应不同的行为转换到不同的状态return responses[action]def game():#画出当前棋盘状态#读取用户输入得到actionif action == 'Restart':return 'Init'if action == 'Exit':return 'Exit'#if 成功移动了一步:if 游戏胜利了:return 'Win'if 游戏失败了:return 'Gameover'return 'Game'state_actions = {'Init': init,'Win': lambda: not_game('Win'),'Gameover': lambda: not_game('Gameover'),'Game': game}state = 'Init'#状态机开始循环while state != 'Exit':state = state_actions[state]()

2.用户输入处理

阻塞+循环,直到获得用户有效输入才返回对应行为:

def get_user_action(keyboard):    char = "N"while char not in actions_dict:    char = keyboard.getch()return actions_dict[char]

3.矩阵转置与矩阵逆转

加入这两个操作可以大大节省我们的代码量,减少重复劳动,看到后面就知道了。

矩阵转置:

def transpose(field):return [list(row) for row in zip(*field)]

矩阵逆转(不是逆矩阵):

def invert(field):return [row[::-1] for row in field]

4.创建棋盘

初始化棋盘的参数,可以指定棋盘的高和宽以及游戏胜利条件,默认是最经典的 4x4~2048。

class GameField(object):def __init__(self, height=4, width=4, win=2048):self.height = height       #高self.width = width         #宽self.win_value = 2048      #过关分数self.score = 0             #当前分数self.highscore = 0         #最高分self.reset()               #棋盘重置
4.1 棋盘操作

随机生成一个2或者4

def spawn(self):new_element = 4 if randrange(100) > 89 else 2(i,j) = choice([(i,j) for i in range(self.width) for j in range(self.height) if self.field[i][j] == 0])self.field[i][j] = new_element

重置棋盘

def reset(self):if self.score > self.highscore:self.highscore = self.scoreself.score = 0self.field = [[0 for i in range(self.width)] for j in range(self.height)]self.spawn()self.spawn()

一行向左合并
(注:这一操作是在move内定义的,拆出来是为了方便阅读)

def move_row_left(row):def tighten(row): # 把零散的非零单元挤到一块new_row = [i for i in row if i != 0]new_row += [0 for i in range(len(row) - len(new_row))]return new_rowdef merge(row): # 对邻近元素进行合并pair = Falsenew_row = []for i in range(len(row)):if pair:new_row.append(2 * row[i])self.score += 2 * row[i]pair = Falseelse:if i + 1 < len(row) and row[i] == row[i + 1]:pair = Truenew_row.append(0)else:new_row.append(row[i])assert len(new_row) == len(row)return new_row#先挤到一块再合并再挤到一块return tighten(merge(tighten(row)))

棋盘走一步
通过对矩阵进行转置与逆转,可以直接从左移得到其余三个方向的移动操作

def move(self, direction):def move_row_left(row):#一行向左合并moves = {}moves['Left']  = lambda field: [move_row_left(row) for row in field]moves['Right'] = lambda field: invert(moves['Left'](invert(field)))moves['Up']    = lambda field: transpose(moves['Left'](transpose(field)))moves['Down']  = lambda field: transpose(moves['Right'](transpose(field)))if direction in moves:if self.move_is_possible(direction):self.field = moves[direction](self.field)self.spawn()return Trueelse:return False

判断输赢

def is_win(self):return any(any(i >= self.win_value for i in row) for row in self.field)def is_gameover(self):return not any(self.move_is_possible(move) for move in actions)

判断能否移动

def move_is_possible(self, direction):def row_is_left_movable(row): def change(i):if row[i] == 0 and row[i + 1] != 0: # 可以移动return Trueif row[i] != 0 and row[i + 1] == row[i]: # 可以合并return Truereturn Falsereturn any(change(i) for i in range(len(row) - 1))check = {}check['Left']  = lambda field: any(row_is_left_movable(row) for row in field)check['Right'] = lambda field: check['Left'](invert(field))check['Up']    = lambda field: check['Left'](transpose(field))check['Down']  = lambda field: check['Right'](transpose(field))if direction in check:return check[direction](self.field)else:return False
4.2 绘制游戏界面

(注:这一步是在棋盘内定义的)

def draw(self, screen):help_string1 = '(W)Up (S)Down (A)Left (D)Right'help_string2 = '     (R)Restart (Q)Exit'gameover_string = '           GAME OVER'win_string = '          YOU WIN!'def cast(string):screen.addstr(string + '\n')#绘制水平分割线def draw_hor_separator():line = '+' + ('+------' * self.width + '+')[1:]separator = defaultdict(lambda: line)if not hasattr(draw_hor_separator, "counter"):draw_hor_separator.counter = 0cast(separator[draw_hor_separator.counter])draw_hor_separator.counter += 1def draw_row(row):cast(''.join('|{: ^5} '.format(num) if num > 0 else '|      ' for num in row) + '|')screen.clear()cast('SCORE: ' + str(self.score))if 0 != self.highscore:cast('HIGHSCORE: ' + str(self.highscore))for row in self.field:draw_hor_separator()draw_row(row)draw_hor_separator()if self.is_win():cast(win_string)else:if self.is_gameover():cast(gameover_string)else:cast(help_string1)cast(help_string2)

5.完成主逻辑

完成以上工作后,我们就可以补完主逻辑了!

def main(stdscr):def init():#重置游戏棋盘game_field.reset()return 'Game'def not_game(state):#画出 GameOver 或者 Win 的界面game_field.draw(stdscr)#读取用户输入得到action,判断是重启游戏还是结束游戏action = get_user_action(stdscr)responses = defaultdict(lambda: state) #默认是当前状态,没有行为就会一直在当前界面循环responses['Restart'], responses['Exit'] = 'Init', 'Exit' #对应不同的行为转换到不同的状态return responses[action]def game():#画出当前棋盘状态game_field.draw(stdscr)#读取用户输入得到actionaction = get_user_action(stdscr)if action == 'Restart':return 'Init'if action == 'Exit':return 'Exit'if game_field.move(action): # move successfulif game_field.is_win():return 'Win'if game_field.is_gameover():return 'Gameover'return 'Game'state_actions = {'Init': init,'Win': lambda: not_game('Win'),'Gameover': lambda: not_game('Gameover'),'Game': game}curses.use_default_colors()game_field = GameField(win=2048)state = 'Init'#状态机开始循环while state != 'Exit':state = state_actions[state]()

6.运行

填上最后一行代码:

curses.wrapper(main)

运行python 2048.py查看结果。
1.jpg

全部代码

#-*- coding:utf-8 -*-import curses
from random import randrange, choice # generate and place new tile
from collections import defaultdictletter_codes = [ord(ch) for ch in 'WASDRQwasdrq']
actions = ['Up', 'Left', 'Down', 'Right', 'Restart', 'Exit']
actions_dict = dict(zip(letter_codes, actions * 2))def get_user_action(keyboard):    char = "N"while char not in actions_dict:    char = keyboard.getch()return actions_dict[char]def transpose(field):return [list(row) for row in zip(*field)]def invert(field):return [row[::-1] for row in field]class GameField(object):def __init__(self, height=4, width=4, win=2048):self.height = heightself.width = widthself.win_value = winself.score = 0self.highscore = 0self.reset()def reset(self):if self.score > self.highscore:self.highscore = self.scoreself.score = 0self.field = [[0 for i in range(self.width)] for j in range(self.height)]self.spawn()self.spawn()def move(self, direction):def move_row_left(row):def tighten(row): # squeese non-zero elements togethernew_row = [i for i in row if i != 0]new_row += [0 for i in range(len(row) - len(new_row))]return new_rowdef merge(row):pair = Falsenew_row = []for i in range(len(row)):if pair:new_row.append(2 * row[i])self.score += 2 * row[i]pair = Falseelse:if i + 1 < len(row) and row[i] == row[i + 1]:pair = Truenew_row.append(0)else:new_row.append(row[i])assert len(new_row) == len(row)return new_rowreturn tighten(merge(tighten(row)))moves = {}moves['Left']  = lambda field:                              \[move_row_left(row) for row in field]moves['Right'] = lambda field:                              \invert(moves['Left'](invert(field)))moves['Up']    = lambda field:                              \transpose(moves['Left'](transpose(field)))moves['Down']  = lambda field:                              \transpose(moves['Right'](transpose(field)))if direction in moves:if self.move_is_possible(direction):self.field = moves[direction](self.field)self.spawn()return Trueelse:return Falsedef is_win(self):return any(any(i >= self.win_value for i in row) for row in self.field)def is_gameover(self):return not any(self.move_is_possible(move) for move in actions)def draw(self, screen):help_string1 = '(W)Up (S)Down (A)Left (D)Right'help_string2 = '     (R)Restart (Q)Exit'gameover_string = '           GAME OVER'win_string = '          YOU WIN!'def cast(string):screen.addstr(string + '\n')def draw_hor_separator():line = '+' + ('+------' * self.width + '+')[1:]separator = defaultdict(lambda: line)if not hasattr(draw_hor_separator, "counter"):draw_hor_separator.counter = 0cast(separator[draw_hor_separator.counter])draw_hor_separator.counter += 1def draw_row(row):cast(''.join('|{: ^5} '.format(num) if num > 0 else '|      ' for num in row) + '|')screen.clear()cast('SCORE: ' + str(self.score))if 0 != self.highscore:cast('HIGHSCORE: ' + str(self.highscore))for row in self.field:draw_hor_separator()draw_row(row)draw_hor_separator()if self.is_win():cast(win_string)else:if self.is_gameover():cast(gameover_string)else:cast(help_string1)cast(help_string2)def spawn(self):new_element = 4 if randrange(100) > 89 else 2(i,j) = choice([(i,j) for i in range(self.width) for j in range(self.height) if self.field[i][j] == 0])self.field[i][j] = new_elementdef move_is_possible(self, direction):def row_is_left_movable(row): def change(i): # true if there'll be change in i-th tileif row[i] == 0 and row[i + 1] != 0: # Movereturn Trueif row[i] != 0 and row[i + 1] == row[i]: # Mergereturn Truereturn Falsereturn any(change(i) for i in range(len(row) - 1))check = {}check['Left']  = lambda field:                              \any(row_is_left_movable(row) for row in field)check['Right'] = lambda field:                              \check['Left'](invert(field))check['Up']    = lambda field:                              \check['Left'](transpose(field))check['Down']  = lambda field:                              \check['Right'](transpose(field))if direction in check:return check[direction](self.field)else:return Falsedef main(stdscr):def init():#重置游戏棋盘game_field.reset()return 'Game'def not_game(state):#画出 GameOver 或者 Win 的界面game_field.draw(stdscr)#读取用户输入得到action,判断是重启游戏还是结束游戏action = get_user_action(stdscr)responses = defaultdict(lambda: state) #默认是当前状态,没有行为就会一直在当前界面循环responses['Restart'], responses['Exit'] = 'Init', 'Exit' #对应不同的行为转换到不同的状态return responses[action]def game():#画出当前棋盘状态game_field.draw(stdscr)#读取用户输入得到actionaction = get_user_action(stdscr)if action == 'Restart':return 'Init'if action == 'Exit':return 'Exit'if game_field.move(action): # move successfulif game_field.is_win():return 'Win'if game_field.is_gameover():return 'Gameover'return 'Game'state_actions = {'Init': init,'Win': lambda: not_game('Win'),'Gameover': lambda: not_game('Gameover'),'Game': game}curses.use_default_colors()# 设置终结状态最大数值为 2048game_field = GameField(win=2048)state = 'Init'#状态机开始循环while state != 'Exit':state = state_actions[state]()curses.wrapper(main)

这篇关于200行Python代码实现2048的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!



http://www.chinasem.cn/article/767479

相关文章

使用Python和OpenCV库实现实时颜色识别系统

《使用Python和OpenCV库实现实时颜色识别系统》:本文主要介绍使用Python和OpenCV库实现的实时颜色识别系统,这个系统能够通过摄像头捕捉视频流,并在视频中指定区域内识别主要颜色(红... 目录一、引言二、系统概述三、代码解析1. 导入库2. 颜色识别函数3. 主程序循环四、HSV色彩空间详解

一文深入详解Python的secrets模块

《一文深入详解Python的secrets模块》在构建涉及用户身份认证、权限管理、加密通信等系统时,开发者最不能忽视的一个问题就是“安全性”,Python在3.6版本中引入了专门面向安全用途的secr... 目录引言一、背景与动机:为什么需要 secrets 模块?二、secrets 模块的核心功能1. 基

PostgreSQL中MVCC 机制的实现

《PostgreSQL中MVCC机制的实现》本文主要介绍了PostgreSQL中MVCC机制的实现,通过多版本数据存储、快照隔离和事务ID管理实现高并发读写,具有一定的参考价值,感兴趣的可以了解一下... 目录一 MVCC 基本原理python1.1 MVCC 核心概念1.2 与传统锁机制对比二 Postg

SpringBoot整合Flowable实现工作流的详细流程

《SpringBoot整合Flowable实现工作流的详细流程》Flowable是一个使用Java编写的轻量级业务流程引擎,Flowable流程引擎可用于部署BPMN2.0流程定义,创建这些流程定义的... 目录1、流程引擎介绍2、创建项目3、画流程图4、开发接口4.1 Java 类梳理4.2 查看流程图4

python常见环境管理工具超全解析

《python常见环境管理工具超全解析》在Python开发中,管理多个项目及其依赖项通常是一个挑战,下面:本文主要介绍python常见环境管理工具的相关资料,文中通过代码介绍的非常详细,需要的朋友... 目录1. conda2. pip3. uvuv 工具自动创建和管理环境的特点4. setup.py5.

C++中零拷贝的多种实现方式

《C++中零拷贝的多种实现方式》本文主要介绍了C++中零拷贝的实现示例,旨在在减少数据在内存中的不必要复制,从而提高程序性能、降低内存使用并减少CPU消耗,零拷贝技术通过多种方式实现,下面就来了解一下... 目录一、C++中零拷贝技术的核心概念二、std::string_view 简介三、std::stri

Python常用命令提示符使用方法详解

《Python常用命令提示符使用方法详解》在学习python的过程中,我们需要用到命令提示符(CMD)进行环境的配置,:本文主要介绍Python常用命令提示符使用方法的相关资料,文中通过代码介绍的... 目录一、python环境基础命令【Windows】1、检查Python是否安装2、 查看Python的安

C++高效内存池实现减少动态分配开销的解决方案

《C++高效内存池实现减少动态分配开销的解决方案》C++动态内存分配存在系统调用开销、碎片化和锁竞争等性能问题,内存池通过预分配、分块管理和缓存复用解决这些问题,下面就来了解一下... 目录一、C++内存分配的性能挑战二、内存池技术的核心原理三、主流内存池实现:TCMalloc与Jemalloc1. TCM

OpenCV实现实时颜色检测的示例

《OpenCV实现实时颜色检测的示例》本文主要介绍了OpenCV实现实时颜色检测的示例,通过HSV色彩空间转换和色调范围判断实现红黄绿蓝颜色检测,包含视频捕捉、区域标记、颜色分析等功能,具有一定的参考... 目录一、引言二、系统概述三、代码解析1. 导入库2. 颜色识别函数3. 主程序循环四、HSV色彩空间

Python UV安装、升级、卸载详细步骤记录

《PythonUV安装、升级、卸载详细步骤记录》:本文主要介绍PythonUV安装、升级、卸载的详细步骤,uv是Astral推出的下一代Python包与项目管理器,主打单一可执行文件、极致性能... 目录安装检查升级设置自动补全卸载UV 命令总结 官方文档详见:https://docs.astral.sh/