Python五子棋

2023-12-26 06:16:27

一、五子棋

五子棋起源于中国,全国智力运动会竞技项目之一,是一种两人对弈的纯策略型棋类游戏。双方分别使用黑白两色的棋子,下在棋盘直线与横线的交叉点上,先形成五子连珠者获胜。

五子棋容易上手,老少皆宜,而且趣味横生,引人入胜。它不仅能增强思维能力,提高智力,而且富含哲理,有助于修身养性。

1.导入库:
?

import pygame
import sys
from pygame.locals import QUIT, KEYDOWN
import numpy as np

2.初始化pygame

pygame.init()
screen = pygame.display.set_mode((670, 670))
screen_color = [238, 154, 73]  # 设置画布颜色,[238,154,73]对应为棕黄色
line_color = [0, 0, 0]  # 设置线条颜色,[0,0,0]对应黑色

3.总代码:

import pygame
import sys
from pygame.locals import QUIT, KEYDOWN
import numpy as np
pygame.init()
screen = pygame.display.set_mode((670, 670))
screen_color = [238, 154, 73]  # 设置画布颜色,[238,154,73]对应为棕黄色
line_color = [0, 0, 0]  # 设置线条颜色,[0,0,0]对应黑色
 
 
def check_win(over_pos):  
    mp = np.zeros([15, 15], dtype=int)
    for val in over_pos:
        x = int((val[0][0]-27)/44)
        y = int((val[0][1]-27)/44)
        if val[1] == white_color:
            mp[x][y] = 2  
        else:
            mp[x][y] = 1 
 
    for i in range(15):
        pos1 = []
        pos2 = []
        for j in range(15):
            if mp[i][j] == 1:
                pos1.append([i, j])
            else:
                pos1 = []
            if mp[i][j] == 2:
                pos2.append([i, j])
            else:
                pos2 = []
            if len(pos1) >= 5:  
                return [1, pos1]
            if len(pos2) >= 5:
                return [2, pos2]
 
    for j in range(15):
        pos1 = []
        pos2 = []
        for i in range(15):
            if mp[i][j] == 1:
                pos1.append([i, j])
            else:
                pos1 = []
            if mp[i][j] == 2:
                pos2.append([i, j])
            else:
                pos2 = []
            if len(pos1) >= 5:
                return [1, pos1]
            if len(pos2) >= 5:
                return [2, pos2]
    for i in range(15):
        for j in range(15):
            pos1 = []
            pos2 = []
            for k in range(15):
                if i+k >= 15 or j+k >= 15:
                    break
                if mp[i+k][j+k] == 1:
                    pos1.append([i+k, j+k])
                else:
                    pos1 = []
                if mp[i+k][j+k] == 2:
                    pos2.append([i+k, j+k])
                else:
                    pos2 = []
                if len(pos1) >= 5:
                    return [1, pos1]
                if len(pos2) >= 5:
                    return [2, pos2]
    for i in range(15):
        for j in range(15):
            pos1 = []
            pos2 = []
            for k in range(15):
                if i+k >= 15 or j-k < 0:
                    break
                if mp[i+k][j-k] == 1:
                    pos1.append([i+k, j-k])
                else:
                    pos1 = []
                if mp[i+k][j-k] == 2:
                    pos2.append([i+k, j-k])
                else:
                    pos2 = []
                if len(pos1) >= 5:
                    return [1, pos1]
                if len(pos2) >= 5:
                    return [2, pos2]
    return [0, []]
 
 
def find_pos(x, y): 
    for i in range(27, 670, 44):
        for j in range(27, 670, 44):
            L1 = i-22
            L2 = i+22
            R1 = j-22
            R2 = j+22
            if x >= L1 and x <= L2 and y >= R1 and y <= R2:
                return i, j
    return x, y
 
 
def check_over_pos(x, y, over_pos): 
    for val in over_pos:
        if val[0][0] == x and val[0][1] == y:
            return False
    return True 
 
 
flag = False
tim = 0
 
over_pos = []
white_color = [255, 255, 255]  
black_color = [0, 0, 0] 
 
while True: 
 
    for event in pygame.event.get():  
        if event.type in (QUIT, KEYDOWN):
            sys.exit()
 
    screen.fill(screen_color)  
    for i in range(27, 670, 44):
        
        if i == 27 or i == 670-27:  
            pygame.draw.line(screen, line_color, [i, 27], [i, 670-27], 4)
        else:
            pygame.draw.line(screen, line_color, [i, 27], [i, 670-27], 2)
        
        if i == 27 or i == 670-27:  
            pygame.draw.line(screen, line_color, [27, i], [670-27, i], 4)
        else:
            pygame.draw.line(screen, line_color, [27, i], [670-27, i], 2)
 
    pygame.draw.circle(screen, line_color, [27+44*7, 27+44*7], 8, 0)
 
    for val in over_pos: 
        pygame.draw.circle(screen, val[1], val[0], 20, 0)
 
 
    res = check_win(over_pos)
    if res[0] != 0:
        for pos in res[1]:
            pygame.draw.rect(screen, [238, 48, 167], [
                             pos[0]*44+27-22, pos[1]*44+27-22, 44, 44], 2, 1)
        pygame.display.update() 
        continue  
    
    x, y = pygame.mouse.get_pos()
 
    x, y = find_pos(x, y)
    if check_over_pos(x, y, over_pos): 
        pygame.draw.rect(screen, [0, 229, 238], [x-22, y-22, 44, 44], 2, 1)
 
    keys_pressed = pygame.mouse.get_pressed() 
 
    if keys_pressed[0] and tim == 0:
        flag = True
        if check_over_pos(x, y, over_pos): 
            if len(over_pos) % 2 == 0:  
                over_pos.append([[x, y], black_color])
            else:
                over_pos.append([[x, y], white_color])
 
    
    if flag:
        tim += 1
    if tim % 50 == 0: 
        flag = False
        tim = 0
 
    pygame.display.update()  

有志者,事竟成,破釜沉舟,百二秦关终属楚;苦心人,天不负,卧薪尝胆,三千越甲可吞吴。

文章来源:https://blog.csdn.net/m0_69824302/article/details/135186637
本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。