Python實(shí)戰(zhàn)系列用于記錄實(shí)戰(zhàn)項(xiàng)目中的思路，代碼實(shí)現(xiàn)，出現(xiàn)的問(wèn)題與解決方案以及可行的改進(jìn)方向
本文為第2篇–200行Python代碼實(shí)現(xiàn)2048

一、分析與函數(shù)設(shè)計(jì)

1.1 游戲玩法
2048這款游戲的玩法很簡(jiǎn)單，每次可以選擇上下左右滑動(dòng)，每滑動(dòng)一次，所有的數(shù)字方塊都會(huì)往滑動(dòng)的方向靠攏，系統(tǒng)也會(huì)在空白的地方亂數(shù)出現(xiàn)一個(gè)數(shù)字方塊，相同數(shù)字的方塊在靠攏、相撞時(shí)會(huì)相加。（介紹來(lái)自百度百科）

1.2 函數(shù)設(shè)計(jì)

_init _() 初始化4*4游戲地圖，分?jǐn)?shù)等游戲基本數(shù)據(jù)

is_gameover() 判斷是否結(jié)束游戲

rannumber() 玩家每次移動(dòng)時(shí)在地圖上隨機(jī)生成2、4

show() 在控制臺(tái)打印出4*4游戲地圖

print_score() 在控制臺(tái)打印出當(dāng)前分?jǐn)?shù)

up(), upmove() 上移

down(), downmove() 下移

left(), leftmove() 左移

right(), rightmove() 右移

nextstep() 讀取玩家按鍵

二、代碼實(shí)現(xiàn)

注：IDE為Spyder，Python版本為3.6

# -*- coding: utf-8 -*- """ Created on Sat Sep 29 16:29:04 2018@author: PastoralDog """ import randomclass game2048(object):def __init__(self):self.score=0self.number=[[0,0,0,0],[0,0,0,0],[0,0,0,0],[0,0,0,0]]self.move=0seed=random.randint(0,15)line=int(seed/4)row=seed%4self.number[line][row]=2 def is_gameover(self):numbersum=0for i in range(4):for j in range(4):if (self.number[i][j]!=0):numbersum+=1if(numbersum!=16): return Falsefor i in range(4):for j in range(3):if(self.number[i][j+1]==self.number[i][j]): return Falsefor i in range(3):for j in range(4):if(self.number[i+1][j]==self.number[i][j]): return Falseprint("游戲結(jié)束")print("您的得分為："+str(self.score))self.__init__()return Truedef rannumber(self):rannumber=random.randint(1,10) if(rannumber<=8): rannumber=2else: rannumber=4done=0count=0for i in range(4):for j in range(4):if(self.number[i][j]==0):count+=1while(done==0 and count!=0):ranplace=random.randint(0,15)line=int(ranplace/4)row=ranplace%4if(self.number[line][row]==0):done=1self.number[line][row]=rannumber def show(self):print(self.number[0])print(self.number[1])print(self.number[2])print(self.number[3])def print_score(self):print("得分："+str(self.score))def upmove(self):for i in range(1,4):for j in range(4):temp=iwhile(temp>=1 and self.number[temp-1][j]==0):box=self.number[temp-1][j]self.number[temp-1][j]=self.number[temp][j]self.number[temp][j]=boxif(self.number[temp][j]!=0):self.move=1temp-=1def up(self):self.upmove()for i in range(1,4):for j in range(4):if(self.number[i-1][j]==self.number[i][j]):if(self.number[i-1][j]!=2048):self.score+=self.number[i][j]self.number[i][j]=0self.number[i-1][j]=2*self.number[i-1][j] self.upmove() if(self.move!=0):self.rannumber()self.move=0self.show()self.is_gameover()self.print_score()def downmove(self):for i in range(2,-1,-1):for j in range(4):temp=iwhile(temp<=2 and self.number[temp+1][j]==0 ):box=self.number[temp+1][j]self.number[temp+1][j]=self.number[temp][j]self.number[temp][j]=boxif(self.number[temp+1][j]!=0):self.move=1temp+=1def down(self):self.downmove()for i in range(2,-1,-1):for j in range(4):if(self.number[i+1][j]==self.number[i][j]):if(self.number[i+1][j]!=2048):self.score+=self.number[i][j]self.number[i][j]=0self.number[i+1][j]=2*self.number[i+1][j] self.downmove()if(self.move!=0):self.rannumber()self.move=0self.show()self.is_gameover()self.print_score()def leftmove(self):for i in range(4):for j in range(1,4): temp=jwhile(temp>=1 and self.number[i][temp-1]==0 ):box=self.number[i][temp-1]self.number[i][temp-1]=self.number[i][temp]self.number[i][temp]=boxif(self.number[i][temp-1]!=0):self.move=1temp-=1def left(self):self.leftmove()for i in range(4):for j in range(0,3):if(self.number[i][j+1]==self.number[i][j]):if(self.number[i][j+1]!=2048):self.score+=self.number[i][j]self.number[i][j+1]=0self.number[i][j]=2*self.number[i][j] self.leftmove()if(self.move!=0):self.rannumber()self.move=0self.show()self.is_gameover()self.print_score()def rightmove(self):for i in range(4):for j in range(2,-1,-1): temp=jwhile(temp<=2 and self.number[i][temp+1]==0 ):box=self.number[i][temp+1]self.number[i][temp+1]=self.number[i][temp]self.number[i][temp]=boxself.move=1temp+=1def right(self):self.rightmove()for i in range(4):for j in range(2,-1,-1):if(self.number[i][j+1]==self.number[i][j]):if(self.number[i][j+1]!=2048):self.score+=self.number[i][j]self.number[i][j]=0self.number[i][j+1]=2*self.number[i][j+1] self.rightmove()if(self.move!=0):self.rannumber()self.move=0self.show()self.is_gameover()self.print_score()def nextstep(self,step):if(step=='w'): self.up()elif(step=='s'): self.down()elif(step=='a'): self.left() elif(step=='d'): self.right()else: passif __name__ == '__main__':game=game2048()game.show()while(True):step=input()if(step=='b'):breakgame.nextstep(step)

三、問(wèn)題與解決方案

地圖的儲(chǔ)存與表示：目前沒(méi)有界面設(shè)計(jì)，因此就用二維數(shù)組直接儲(chǔ)存與表示

數(shù)組越界：調(diào)試代碼中遇到過(guò)五六次，除了牢記要邊緣檢測(cè)外， and 語(yǔ)句左右條件順序也要有講究。
例：while(temp<=2 and self.number[temp+1][j]==0 ) 注：self.number為4*4的二維數(shù)組
當(dāng)temp=3時(shí)，語(yǔ)句在temp<=2 被阻塞，不會(huì)執(zhí)行self.number[temp+1][j]==0，此時(shí)沒(méi)有問(wèn)題;
若語(yǔ)句改為while(self.number[temp+1][j]==0 and temp<=2), 先執(zhí)行self.number[temp+1][j]==0，此時(shí)編譯器報(bào)錯(cuò)數(shù)組越界

四、可行的改進(jìn)方向

添加可視化界面，可考慮Tkinter，QT等

拓展游戲地圖大小為N x N

本人水平有限，歡迎大家提出問(wèn)題與建議。若代碼有看不懂的地方，也歡迎提出！

與50位技術(shù)專家面對(duì)面20年技術(shù)見(jiàn)證，附贈(zèng)技術(shù)全景圖

總結(jié)

以上是生活随笔為你收集整理的Python实战2 - 200行Python代码实现2048（控制台）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。