本文实例为大家分享了python实现五子棋游戏的具体代码,供大家参考,具体内容如下
话不多说,直接上代码:
全部工程文件,在github:五子棋
效果预览:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
#!/usr/bin/env python3 #-*- coding:utf-8 -*- import pygame from pygame. locals import * from sys import exit import numpy background_image = 'qipan.png' white_image = 'white.png' black_image = 'black.png' def whowin(x,y,darray): num1,num2,num3,num4 = 0 , 0 , 0 , 0 #判断上下左右左上右上左下右下8个方向 i = x - 1 while (i> = 0 ): if darray[i][y] = = 1 : num1 + = 1 i - = 1 else : break i = x + 1 while i< 19 : if darray[i][y] = = 1 : num1 + = 1 i + = 1 else : break j = y - 1 while (j > = 0 ): if darray[x][j] = = 1 : num2 + = 1 j - = 1 else : break j = y + 1 while j < 19 : if darray[x][j] = = 1 : num2 + = 1 j + = 1 else : break i,j = x - 1 ,y - 1 while (i> = 0 and j> = 0 ): if darray[i][j] = = 1 : num3 + = 1 i - = 1 j - = 1 else : break i, j = x + 1 , y + 1 while (i < 19 and j < 19 ): if darray[i][j] = = 1 : num3 + = 1 i + = 1 j + = 1 else : break i, j = x + 1 , y - 1 while (i > = 0 and j > = 0 ): if darray[i][j] = = 1 : num4 + = 1 i + = 1 j - = 1 else : break i, j = x - 1 , y + 1 while (i < 19 and j < 19 ): if darray[i][j] = = 1 : num4 + = 1 i - = 1 j + = 1 else : break #五子胜 if num1> = 4 or num2> = 4 or num3 > = 4 or num4 > = 4 : return true else : return false #初始化 pygame.init() #屏幕、背景图、白黑子转换 screen = pygame.display.set_mode(( 584 , 584 ), resizable, 32 ) background = pygame.image.load(background_image).convert() white = pygame.image.load(white_image).convert_alpha() black = pygame.image.load(black_image).convert_alpha() #标题画图字体 screen.blit(background, ( 0 , 0 )) font = pygame.font.sysfont( "arial" , 40 ); pygame.display.set_caption( '五子棋' ) #zeros()返回19行19列的数组 white_luodian = numpy.zeros(( 19 , 19 )) black_luodian = numpy.zeros(( 19 , 19 )) #设置棋盘的所有点的坐标 qipan_list = [( 30 + i * 29 - 12 , 30 + j * 29 - 12 ) for i in range ( 19 ) for j in range ( 19 )] #默认黑子先手,转换下棋 transw_b = true #游戏主循环 while true: for event in pygame.event.get(): if event. type = = quit: exit() if event. type = = mousebuttondown: x,y = pygame.mouse.get_pos() if 30 < = x < = 554 and 30 < = y < = 554 and ((x - 30 ) % 29 < = 12 or (x - 30 ) % 29 > = 17 ) and ( (y - 30 ) % 29 < = 12 or (y - 30 ) % 29 > = 17 ): #四舍五入 m = int ( round ((x - 30 ) / 29 )) n = int ( round ((y - 30 ) / 29 )) #结果分析 if transw_b: transw_b = not transw_b screen.blit(black, qipan_list[ 19 * m + n]) black_luodian[n][m] = 1 if whowin(n,m,black_luodian): screen.blit(font.render( 'black chess player wins!' , true, ( 0 , 0 , 0 ),( 0 , 229 , 238 )), ( 120 , 280 )) else : transw_b = not transw_b screen.blit(white, qipan_list[ 19 * m + n]) white_luodian[n][m] = 1 if whowin(n,m,white_luodian): screen.blit(font.render( 'white chess player wins!' , true, ( 255 , 255 , 255 ),( 0 , 229 , 238 )), ( 120 , 280 )) qipan_list[ 19 * m + n] = '' pygame.display.update() |
以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持服务器之家。
原文链接:https://blog.csdn.net/ArthurCaoMH/article/details/88376553