1.三子棋游戏规则
三子棋是一种民间传统游戏,又叫九宫棋、圈圈叉叉、一条龙、井字棋等。将正方形对角线连起来,相对两边依次摆上三个双方棋子,只要将自己的三个棋子走成一条线,对方就算输了。但是,有很多时候会出现和棋的情况。
2.设计思路
1.创建棋盘,并且初始化,将所有位置设置为空格。
2.打印棋盘
3.玩家通过输入坐标(row,col)进行落子
4.判定胜负
5.电脑随机落子
6.判断胜负
3.代码详解
(1)为了避免混乱则使用宏定义
#define MAX_ROW 3
#define MAX_COL 3
char chessBoard[3]3];
char chessBoard[MAX_ROW][MAX_COL];
(2)初始化函数 将棋盘的每一个位置都初始化为空格
void init(char chess[MAX_ROW][MAX_COL])
{
for (int row = 0; row < MAX_ROW; row++)
{
for (int col = 0; col < MAX_COL; col++)
{
chess[row][col] = ' ';
}
}
}
(3)打印棋盘
void print(char chess[MAX_ROW][MAX_COL])
{
printf("+---+---+---+\n");
for (int row = 0; row < MAX_ROW; row++)
{
printf("|");
for (int col = 0; col < MAX_COL; col++)
{
printf(" %c |", chess[row][col]);
}
printf("\n+---+---+---+\n");
}
}
(4)玩家落子
void playerMove(char chessBoard[MAX_ROW][MAX_COL])
{
printf("玩家落子....\n");
while (1)
{
printf("请输入坐标(row col): ");
int row = 0;
int col = 0;
scanf("%d %d", &row, &col);
if (row < 0 || row >= MAX_ROW || col < 0 || col >= MAX_COL)
{
printf("输入坐标非法! 请重新输入!\n");
continue;
}
if (chessBoard[row][col] != ' ')
{
printf("已经有子, 请重新输入!\n");
continue;
}
chessBoard[row][col] = 'x';
break;
}
}
(5)判断胜负
char isGameOver(char chessBoard[MAX_ROW][MAX_COL])
{
// 所有的行, 所有的列, 以及对角线
for (int row = 0; row < MAX_ROW; row++) {
if (chessBoard[row][0] != ' '
&& chessBoard[row][0] == chessBoard[row][1]
&& chessBoard[row][0] == chessBoard[row][2])
{
return chessBoard[row][0];
}
}
for (int col = 0; col < MAX_COL; col++) {
if (chessBoard[0][col] != ' '
&& chessBoard[0][col] == chessBoard[1][col]
&& chessBoard[0][col] == chessBoard[2][col])
{
return chessBoard[0][col];
}
}
if (chessBoard[0][0] != ' '
&& chessBoard[0][0] == chessBoard[1][1]
&& chessBoard[0][0] == chessBoard[2][2])
{
return chessBoard[0][0];
}
if (chessBoard[0][2] != ' '
&& chessBoard[0][2] == chessBoard[1][1]
&& chessBoard[0][2] == chessBoard[2][0])
{
return chessBoard[0][2];
}
// 判定是否和棋
//棋盘是否满了
if (isFull(chessBoard))
{
return 'q';
}
// 胜负未分
return ' ';
}
(6)电脑落子
void computerMove(char chessBoard[MAX_ROW][MAX_COL])
{
while (1) {
int row = rand() % MAX_ROW;
int col = rand() % MAX_COL;
if (chessBoard[row][col] != ' ')
{
continue;
}
chessBoard[row][col] = 'o';
break;
}
}
(7)判断棋盘函数
int isFull(char chessBoard[MAX_ROW][MAX_COL])
{
// 遍历棋盘, 判断是否有空格
for (int row = 0; row < MAX_ROW; row++)
{
for (int col = 0; col < MAX_COL; col++)
{
if (chessBoard[row][col] == ' ')
{
return 0;
}
}
}
return 1;
}