Python pygame 중국 장기 단기 판 소스 실현
마우스 클릭 으로 조작 하기;이틀 동안 제작 되 었 는데 비교적 거 칠 고 많은 효과 가 아직 실현 되 지 않 았 다.
# -*- coding: utf-8 -*-
"""
Created on Sun Jun 13 15:41:56 2021
@author: Administrator
"""
import pygame
from pygame.locals import *
import sys
import math
pygame.init()
screen=pygame.display.set_mode((450,550))
pygame.display.set_caption(' ')
img_board=pygame.image.load('F:/images/ /board.png')
img_redSoldier=pygame.image.load('F:/images/ /chess_redSoldier.png')
img_redCannon=pygame.image.load('F:/images/ /chess_redCannon.png')
img_redCar=pygame.image.load('F:/images/ /chess_redCar.png')
img_redHorse=pygame.image.load('F:/images/ /chess_redHorse.png')
img_redElephant=pygame.image.load('F:/images/ /chess_redElephant.png')
img_redAttendant=pygame.image.load('F:/images/ /chess_redAttendant.png')
img_chief=pygame.image.load('F:/images/ /chess_chief.png')
img_blackSoldier=pygame.image.load('F:/images/ /chess_blackSoldier.png')
img_blackCannon=pygame.image.load('F:/images/ /chess_blackCannon.png')
img_blackCar=pygame.image.load('F:/images/ /chess_blackCar.png')
img_blackHorse=pygame.image.load('F:/images/ /chess_blackHorse.png')
img_blackElephant=pygame.image.load('F:/images/ /chess_blackElephant.png')
img_blackAttendant=pygame.image.load('F:/images/ /chess_blackAttendant.png')
img_general=pygame.image.load('F:/images/ /chess_general.png')
screen.blit(img_board,(0,0))
pygame.display.update()
red_chess=[[0,6],[2,6],[4,6],[6,6],[8,6],[1,7],[7,7],[0,9],[1,9],[2,9],[3,9],[4,9],[5,9],[6,9],[7,9],[8,9]]
black_chess=[[0,3],[2,3],[4,3],[6,3],[8,3],[1,2],[7,2],[0,0],[1,0],[2,0],[3,0],[4,0],[5,0],[6,0],[7,0],[8,0]]
#
def draw_chess():
for i in range(len(red_chess)):
if 0<=i<=4:
screen.blit(img_redSoldier,(red_chess[i][0]*50,red_chess[i][1]*50))
elif 5<=i<=6:
screen.blit(img_redCannon,(red_chess[i][0]*50,red_chess[i][1]*50))
elif i==7 or i==15:
screen.blit(img_redCar,(red_chess[i][0]*50,red_chess[i][1]*50))
elif i==8 or i==14:
screen.blit(img_redHorse,(red_chess[i][0]*50,red_chess[i][1]*50))
elif i==9 or i==13:
screen.blit(img_redElephant,(red_chess[i][0]*50,red_chess[i][1]*50))
elif i==10 or i==12:
screen.blit(img_redAttendant,(red_chess[i][0]*50,red_chess[i][1]*50))
else:
screen.blit(img_chief,(red_chess[i][0]*50,red_chess[i][1]*50))
for i in range(len(black_chess)):
if 0<=i<=4:
screen.blit(img_blackSoldier,(black_chess[i][0]*50,black_chess[i][1]*50))
elif 5<=i<=6:
screen.blit(img_blackCannon,(black_chess[i][0]*50,black_chess[i][1]*50))
elif i==7 or i==15:
screen.blit(img_blackCar,(black_chess[i][0]*50,black_chess[i][1]*50))
elif i==8 or i==14:
screen.blit(img_blackHorse,(black_chess[i][0]*50,black_chess[i][1]*50))
elif i==9 or i==13:
screen.blit(img_blackElephant,(black_chess[i][0]*50,black_chess[i][1]*50))
elif i==10 or i==12:
screen.blit(img_blackAttendant,(black_chess[i][0]*50,black_chess[i][1]*50))
else:
screen.blit(img_general,(black_chess[i][0]*50,black_chess[i][1]*50))
pygame.display.update()
# 1 , 2 , 0
# , chess1 red_chess,chess2 black_chess
def soldier_rule(chess1,chess2,current_pos,next_pos):
if chess1==red_chess:
pos,index=[5,6],1
elif chess1==black_chess:
pos,index=[3,4],-1
if current_pos[1] in pos:
if current_pos[0]==next_pos[0] and current_pos[1]==next_pos[1]+index and next_pos not in chess1:
for i in range(len(chess2)):
if chess2[i]==next_pos:
chess2[i]=[-1,-1]
current_pos=next_pos
return [current_pos,2]
current_pos=next_pos
return [current_pos,1]
else:
if current_pos[0]==next_pos[0] and current_pos[1]==next_pos[1]+index and next_pos not in chess1:
for i in range(len(chess2)):
if chess2[i]==next_pos:
chess2[i]=[-1,-1]
current_pos=next_pos
return [current_pos,2]
current_pos=next_pos
return [current_pos,1]
elif current_pos[1]==next_pos[1] and current_pos[0]+1==next_pos[0] and next_pos not in chess1:
for i in range(len(chess2)):
if chess2[i]==next_pos:
chess2[i]=[-1,-1]
current_pos=next_pos
return [current_pos,2]
current_pos=next_pos
return [current_pos,1]
elif current_pos[1]==next_pos[1] and current_pos[0]-1==next_pos[0] and next_pos not in chess1:
for i in range(len(chess2)):
if chess2[i]==next_pos:
chess2[i]=[-1,-1]
current_pos=next_pos
return [current_pos,2]
current_pos=next_pos
return [current_pos,1]
# , red_chess、black_chess, black_chess、red_chess
def car_rule(chess1,chess2,current_pos,next_pos):
if next_pos not in chess1 and current_pos[0]==next_pos[0]:
a,b=current_pos,next_pos
if a[1]>b[1]:
a,b=b,a
for i in range(a[1]+1,b[1]):
if [a[0],i] in black_chess+red_chess:
return 0
for i in range(len(chess2)):
if chess2[i]==next_pos:
chess2[i]=[-1,-1]
current_pos=next_pos
return [current_pos,2]
current_pos=next_pos
return [current_pos,1]
elif next_pos not in chess1 and current_pos[1]==next_pos[1]:
a,b=current_pos,next_pos
if a[0]>b[0]:
a,b=b,a
for i in range(a[0]+1,b[0]):
if [i,a[1]] in black_chess+red_chess:
return 0
for i in range(len(chess2)):
if chess2[i]==next_pos:
chess2[i]=[-1,-1]
current_pos=next_pos
return [current_pos,2]
current_pos=next_pos
return [current_pos,1]
#
def cannon_rule(chess1,chess2,current_pos,next_pos):
if next_pos not in chess1 and current_pos[0]==next_pos[0]:
num=0
a,b=current_pos,next_pos
if a[1]>b[1]:
a,b=b,a
for i in range(a[1]+1,b[1]):
if [a[0],i] in black_chess+red_chess:
num+=1
if num==1:
for i in range(len(chess2)):
if chess2[i]==next_pos:
chess2[i]=[-1,-1]
current_pos=next_pos
return [current_pos,2]
return 0
elif num==0:
current_pos=next_pos
return [current_pos,1]
else:
return 0
elif next_pos not in chess1 and current_pos[1]==next_pos[1]:
num=0
a,b=current_pos,next_pos
if a[0]>b[0]:
a,b=b,a
for i in range(a[0]+1,b[0]):
if [i,a[1]] in black_chess+red_chess:
num+=1
if num==1:
for i in range(len(chess2)):
if chess2[i]==next_pos:
chess2[i]=[-1,-1]
current_pos=next_pos
return [current_pos,2]
return 0
elif num==0:
current_pos=next_pos
return [current_pos,1]
else:
return 0
# , chess black_chess
def horse_rule(chess,current_pos,next_pos):
index=[[2,-1],[1,-2],[-1,-2],[-2,-1],[-2,1],[-1,2],[1,2],[2,1]]
leg=[[1,0],[0,-1],[0,-1],[-1,0],[-1,0],[0,1],[0,1],[1,0]]
if next_pos not in red_chess+black_chess:
for i in range(len(index)):
if current_pos[0]+index[i][0]==next_pos[0] and current_pos[1]+index[i][1]==next_pos[1]:
if [current_pos[0]+leg[i][0],current_pos[1]+leg[i][1]] not in black_chess+red_chess:
current_pos=next_pos
return [current_pos,1]
elif next_pos in chess:
for i in range(len(index)):
if current_pos[0]+index[i][0]==next_pos[0] and current_pos[1]+index[i][1]==next_pos[1]:
if [current_pos[0]+leg[i][0],current_pos[1]+leg[i][1]] not in black_chess+red_chess:
for i in range(len(chess)):
if chess[i]==next_pos:
chess[i]=[-1,-1]
current_pos=next_pos
return [current_pos,2]
# , chess black_chess
def elephant_rule(chess,current_pos,next_pos):
index=[[2,-2],[-2,-2],[-2,2],[2,2]]
leg=[[1,-1],[-1,-1],[-1,1],[1,1]]
if chess==black_chess:
pos=[5,7,9]
elif chess==red_chess:
pos=[0,2,4]
if next_pos not in red_chess+black_chess and next_pos[1] in pos:
for i in range(len(index)):
if current_pos[0]+index[i][0]==next_pos[0] and current_pos[1]+index[i][1]==next_pos[1]:
if [current_pos[0]+leg[i][0],current_pos[1]+leg[i][1]] not in black_chess+red_chess:
current_pos=next_pos
return [current_pos,1]
elif next_pos in chess and next_pos[1] in pos:
for i in range(len(index)):
if current_pos[0]+index[i][0]==next_pos[0] and current_pos[1]+index[i][1]==next_pos[1]:
if [current_pos[0]+leg[i][0],current_pos[1]+leg[i][1]] not in black_chess+red_chess:
for i in range(len(chess)):
if chess[i]==next_pos:
chess[i]=[-1,-1]
current_pos=next_pos
return [current_pos,2]
#
def attendant_rule(chess1,chess2,current_pos,next_pos):
if chess1==red_chess:
pos1=[[3,9],[3,7],[5,7],[5,9]]
pos2=[4,8]
elif chess1==black_chess:
pos1=[[3,0],[3,2],[5,2],[5,0]]
pos2=[4,1]
if current_pos in pos1 and next_pos==pos2 and next_pos not in chess1:
if next_pos not in chess2:
current_pos=next_pos
return [current_pos,1]
else:
for i in range(len(chess2)):
if chess2[i]==next_pos:
chess2[i]=[-1,-1]
current_pos=next_pos
return [current_pos,2]
elif current_pos==pos2 and next_pos in pos1 and next_pos not in chess1:
if next_pos not in chess2:
current_pos=next_pos
return [current_pos,1]
else:
for i in range(len(chess2)):
if chess2[i]==next_pos:
chess2[i]=[-1,-1]
current_pos=next_pos
return [current_pos,2]
#
def boss_rule(chess1,chess2,current_pos,next_pos,j_pos):
if chess1==red_chess:
pos=[7,8,9]
elif chess1==black_chess:
pos=[0,1,2]
flag=0
if next_pos not in chess1:
if next_pos[0]==j_pos[0]:
for i in range(j_pos[1]+1,next_pos[1]):
if [j_pos[0],j_pos[1]+i] in black_chess+red_chess:
flag=1
break
if flag==0:
return 0
if next_pos not in chess1 and 3<=next_pos[0]<=5 and next_pos[1] in pos:
if next_pos not in chess2:
if current_pos[0]==next_pos[0]:
if current_pos[1]+1==next_pos[1] or current_pos[1]-1==next_pos[1]:
current_pos=next_pos
return [current_pos,1]
elif current_pos[1]==next_pos[1]:
if current_pos[0]+1==next_pos[0] or current_pos[0]-1==next_pos[0]:
current_pos=next_pos
return [current_pos,1]
else:
if current_pos[0]==next_pos[0]:
if current_pos[1]+1==next_pos[1] or current_pos[1]-1==next_pos[1]:
for i in range(len(chess2)):
if chess2[i]==next_pos:
chess2[i]=[-1,-1]
current_pos=next_pos
return [current_pos,2]
elif current_pos[1]==next_pos[1]:
if current_pos[0]+1==next_pos[0] or current_pos[0]-1==next_pos[0]:
for i in range(len(chess2)):
if chess2[i]==next_pos:
chess2[i]=[-1,-1]
current_pos=next_pos
return [current_pos,2]
#
def move(chess1,chess2,next_pos):
x=0
if i in range(5): #
x=soldier_rule(chess1,chess2,chess1[i],next_pos)
if x!=None and x!=0:
chess1[i]=x[0]
print(chess1[i])
screen.blit(img_board,(0,0))
draw_chess()
elif i==5 or i==6: #
x=cannon_rule(chess1,chess2,chess1[i],next_pos)
if x!=None and x!=0:
chess1[i]=x[0]
print(chess1[i])
screen.blit(img_board,(0,0))
draw_chess()
elif i==7 or i==15: #
x=car_rule(chess1,chess2,chess1[i],next_pos)
if x!=None and x!=0:
chess1[i]=x[0]
print(chess1[i])
screen.blit(img_board,(0,0))
draw_chess()
elif i==8 or i==14: #R
x=horse_rule(chess2,chess1[i],next_pos)
if x!=None and x!=0:
chess1[i]=x[0]
print(chess1[i])
screen.blit(img_board,(0,0))
draw_chess()
elif i==9 or i==13: #
x=elephant_rule(chess2,chess1[i],next_pos)
if x!=None and x!=0:
chess1[i]=x[0]
print(chess1[i])
screen.blit(img_board,(0,0))
draw_chess()
elif i==10 or i==12: #
x=attendant_rule(chess1,chess2,chess1[i],next_pos)
if x!=None and x!=0:
chess1[i]=x[0]
print(chess1[i])
screen.blit(img_board,(0,0))
draw_chess()
else: #
x=boss_rule(chess1,chess2,chess1[i],next_pos,chess2[11])
if x!=None and x!=0:
chess1[i]=x[0]
print(chess1[i])
screen.blit(img_board,(0,0))
draw_chess()
return x
white=(255,255,255)
black=(0,0,0)
def draw_text(text,x,y,size):
pygame.font.init()
fontObj=pygame.font.SysFont('SimHei',size )
textSurfaceObj=fontObj.render(text, True, white,black)
textRectObj=textSurfaceObj.get_rect()
textRectObj.center=(x,y)
screen.blit(textSurfaceObj, textRectObj)
pygame.display.update()
#
def game_over():
if red_chess[11]==[-1,-1]:
draw_text(' ',225,525,15)
return 1
elif black_chess[11]==[-1,-1]:
draw_text(' ',225,525,15)
return 1
if __name__=='__main__':
all_pos,progress=[],[]
for i in range(10):
for j in range(9):
all_pos.append([j,i])
draw_text(' ',225,525,15)
chess_kind=0
while True:
draw_chess()
for event in pygame.event.get():
if event.type==QUIT:
pygame.quit()
sys.exit()
elif event.type==MOUSEBUTTONDOWN:
pos=pygame.mouse.get_pos()
print(pos)
if chess_kind==0:
chess1,chess2=red_chess,black_chess
elif chess_kind==1:
chess1,chess2=black_chess,red_chess
for i in range(len(chess1)):
if chess1[i][0]*50<pos[0]<(chess1[i][0]+1)*50 and chess1[i][1]*50<pos[1]<(chess1[i][1]+1)*50:
flag=False
while True:
for event in pygame.event.get():
if event.type==MOUSEBUTTONDOWN:
pos=pygame.mouse.get_pos()
next_pos=[pos[0]//50,pos[1]//50]
flag=True
break
if flag==True:
break
progress.append(move(chess1,chess2,next_pos))
if progress[-1]!=None and progress[-1]!=0:
if chess_kind==0:
chess_kind=1
elif chess_kind==1:
chess_kind=0
if chess_kind==1:
draw_text(' ',225,525,15)
elif chess_kind==0:
draw_text(' ',225,525,15)
if game_over()==1:
while True:
for event in pygame.event.get():
if event.type==QUIT:
pygame.quit()
sys.exit()
break
바둑판 그림:바둑 알 그림:
실행 효과:
파 이 썬 pygame 이 중국 장기 단기 판 소스 코드 를 실현 하 는 것 에 관 한 이 글 은 여기까지 소개 되 었 습 니 다.더 많은 관련 pygame 이 중국 장 기 를 실현 하 는 내용 은 우리 의 이전 글 을 검색 하거나 아래 의 관련 글 을 계속 조회 하 시기 바 랍 니 다.앞으로 많은 응원 바 랍 니 다!
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
Python의 None과 NULL의 차이점 상세 정보그래서 대상 = 속성 + 방법 (사실 방법도 하나의 속성, 데이터 속성과 구별되는 호출 가능한 속성 같은 속성과 방법을 가진 대상을 클래스, 즉 Classl로 분류할 수 있다.클래스는 하나의 청사진과 같아서 하나의 ...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.