目录
1.棋盘的创建
2.实现玩家和电脑下棋
3.判断输赢
棋盘的创建
棋盘初始化:
先利用二维数组创建一个3乘3的棋盘,而棋盘的参数可以利用全局变量创建以实现不同棋盘的转换,方便修改bug。首先第一步要初始化棋盘,防止格式错误,
void Initboard(char board[ROW][COL], int row, int col)
{
int i, j;
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
board[i][j] = ' ';
}
}
}
打印棋盘:
int i, j;
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
printf(" %c ", board[i][j]);
if (j < col - 1)
printf("|");
}
printf("\n");
void Displayboard(char board[ROW][COL], int row, int col)
{
int i, j;
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
printf(" %c ", board[i][j]);
if (j < col - 1)
printf("|");
}
printf("\n");
if (i < row - 1)
{
for (j = 0; j < col; j++)
{
printf("---");
if (j < col - 1)
printf("|");
}
printf("\n");
}
}
}
玩家下棋:
void Playmove(char board[ROW][COL], int row, int col)
{
int x = 0, y = 0;
printf("玩家走->\n");
printf("请输入下棋的坐标:>");
scanf("%d %d", &x, &y);
//判断坐标的合法性
while (1)
{
if (x >= 1 && x <= row && y >= 1 && y <= col)
{
//判断坐标是否被占用
if (board[x - 1][y - 1] == ' ')
{
board[x - 1][y - 1] = '*';
break;
}
else
{
printf("坐标已被占用,请重新输入");
break;
}
}
else
{
printf("坐标非法,请重新输入\n");
break;
}
}
}
电脑下棋:
void Computermove(char board[ROW][COL], int row, int col)
{
printf("电脑走:>\n");
while (1)
{
int x = rand() % row;
int y = rand() % col;
if (board[x][y] == ' ')
{
board[x][y] = '#';
break;
}
}
}
判断输赢:
int Isfull(char board[ROW][COL], int row, int col)
{
int i, j;
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
if (board[i][j] == ' ')
return 0;
}
}
return 1;
}
char Iswin(char board[ROW][COL], int row, int col)
{
int i = 0;
for (i = 0; i < row; i++)
{
if (board[i][0] == board[i][1] && board[i][0] == board[i][2] && board[i][0] != ' ')
return board[i][0];
}
for (i = 0; i < col; i++)
{
if (board[0][i] == board[1][i] && board[0][i] == board[2][i] && board[0][i] != ' ')
return board[0][i];
}
if (board[1][1] == board[0][0] && board[0][0] == board[2][2] && board[0][0] != ' ')
return board[1][1];
if (board[0][2] == board[1][1] && board[0][2] == board[2][0] && board[0][2] != ' ')
return board[1][1];
int k = Isfull( board, row, col);
if (k == 1)
return 'Q';
return 'C';
}