-
Notifications
You must be signed in to change notification settings - Fork 1
/
gobang.c
171 lines (144 loc) · 4.29 KB
/
gobang.c
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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
#include <stdio.h>
#include <stdlib.h>
#define N 15
#define CHESSBOARD_LIM (i >= 1 && i <= N && j >= 1 && j <= N)
int chessboard[N + 1][N + 1] = { 0 };
int whoseTurn = 0;
void initGame(void);
void printChessboard(void);
void playChess(void);
int judge(int, int);
int main(void)
{
initGame();
while (1)
{
whoseTurn++;
playChess();
}
return 0;
}
void initGame(void)
{
char ch;
printf("Enter \'y\' to start the game: ");
ch = getchar();
if (ch != 'y' && ch != 'Y')
exit(0);
system("clear"); /* 清屏 */
printChessboard();
}
void printChessboard(void)
{
int i, j;
for (i = 0; i <= N; i++)
{
for (j = 0; j <= N; j++)
{
if (i == 0)
printf("%3d", j);
else if (j == 0)
printf("%3d", i);
else if (chessboard[i][j] == 1)
printf(" O");
else if (chessboard[i][j] == 2)
printf(" X");
else
printf(" *");
}
printf("\n");
}
}
void playChess(void)
{
int i, j;
printf("Turn to player %c, please enter the position: ", whoseTurn % 2 == 1? '1': '2');
scanf("%d %d", &i, &j);
/* 检查输入范围 */
while (!CHESSBOARD_LIM)
{
fprintf(stderr, "Exceed the size of the chessboard, try again: ");
scanf("%d %d", &i, &j);
}
while (chessboard[i][j] != 0)
{
printf("This position has been occupied, please enter the position again:");
scanf("%d %d", &i, &j);
}
/* 储存棋子 */
chessboard[i][j] = whoseTurn % 2 == 1? 1: 2;
/* 显示棋盘 */
system("clear");
printChessboard();
/* 检验胜利条件 */
if (judge(i, j))
{
printf("Winner is player %c!\n", whoseTurn % 2 == 1? '1': '2');
exit(EXIT_SUCCESS);
}
}
int judge(int x, int y)
{
int i, /* 行坐标 */
j, /* 纵坐标 */
r; /* 连续棋子数量 */
int t = 2 - whoseTurn % 2; /* 当前棋子种类 */
/* 纵向胜利 */
for (r = 1, i = x, j = y; chessboard[++i][j] == t && CHESSBOARD_LIM && r <= 5; r++)
continue;
for (i = x, j = y; chessboard[--i][j] == t && CHESSBOARD_LIM && r <= 5; r++)
continue;
if (r >= 5) /* 处理连成五子以上的情况 */
return 1;
/* 横向胜利 */
for (r = 1, i = x, j = y; chessboard[i][++j] == t && CHESSBOARD_LIM && r <= 5; r++)
continue;
for (i = x, j = y; chessboard[i][--j] == t && CHESSBOARD_LIM && r <= 5; r++)
continue;
if (r >= 5)
return 1;
/* "/"型斜向胜利 */
for (r = 1, i = x, j = y; chessboard[++i][--j] == t && CHESSBOARD_LIM && r <= 5; r++)
continue;
for (i = x, j = y; chessboard[--i][++j] == t && CHESSBOARD_LIM && r <= 5; r++)
continue;
if (r >= 5)
return 1;
/* "\"型斜向胜利 */
for (r = 1, i = x, j = y; chessboard[++i][++j] == t && CHESSBOARD_LIM && r <= 5; r++)
continue;
for (i = x, j = y; chessboard[--i][--j] == t && CHESSBOARD_LIM && r <= 5; r++)
continue;
if (r >= 5)
return 1;
/* 未触发胜利条件 */
return 0;
}
/*
int judge(int x, int y) //原算法
{
int i, j;
int t = 2 - whoseTurn % 2;
for (i = x - 4, j = y; i <= x; i++)
{
if (i >= 1 && i <= N - 4 && t == chessboard[i][j] && t == chessboard[i + 1][j] && t == chessboard[i + 2][j] && t == chessboard[i + 3][j] && t == chessboard[i + 4][j])
return 1;
}
for (i = x, j = y - 4; j <= y; j++)
{
if (j >= 1 && j <= N - 4 && t == chessboard[i][j] && t == chessboard[i][j + 1] && t == chessboard[i][j + 2] && t == chessboard[i][j + 3] && t == chessboard[i][j + 4])
return 1;
}
for (i = x - 4, j = y - 4; i <= x && j <= y; i++, j++)
{
if (i >= 1 && i <= N - 4 && j >= 1 && j <= N - 4 && t == chessboard[i][j] && t == chessboard[i + 1][j + 1] && t == chessboard[i + 2][j + 2] && t == chessboard[i + 3][j + 3] && t == chessboard[i + 4][j + 4])
return 1;
}
for (i = x + 4, j = y - 4; i >= 1 && j <= y; i--, j++)
{
if (i >= 1 && i <= N - 4 && j >= 1 && j <= N - 4 && t == chessboard[i][j] && t == chessboard[i - 1][j + 1] && t == chessboard[i - 2][j + 2] && t == chessboard[i - 3][j + 3] && t == chessboard[i - 4][j + 4])
return 1;
}
return 0;
}
*/