当前位置:网站首页>“纯C”实现——三子棋小游戏
“纯C”实现——三子棋小游戏
2022-08-02 10:48:00 【InfoQ】
文章目录
- 三子棋实现思路
- 棋盘实现
- 玩家下棋
- 电脑下棋
- 判断输赢
- 小结语
三子棋实现思路
我们第一步是要打印棋盘:
那么第二步:
第三步:
第四步:
第五步:


棋盘实现
#define ROW 3 //行
#define COL 3 //列
char board[ROW][COL]
//初始化成空格
void InitBoard(char board[ROW][COL], int row, int col)
{
int i = 0;
int j = 0;
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
board[i][j] = ' ';
}
}
}


//打印棋盘
void BoardPrint(char board[ROW][COL], int row, int col)
{
int i = 0;
int j = 0;
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
printf(" %c ",board[i][j]);
//可以看到图片里的最后一列是没有竖杆的,所以这里要判断一下
//如果是最后一列就不必打印竖杆
if(j<col-1)
printf("|");
}
printf("\n");
for (j = 0; j < col; j++)
{
printf("---");
//这里跟上面用一个意思
if (j < col - 1)
printf("|");
}
printf("\n");
}
}
玩家下棋

void PlayerMove(char board[ROW][COL], int row, int col)
{
while (1)
{
printf("请输入坐标>:");
int x = 0;
int y = 0;
scanf("%d %d", &x, &y);
//判断坐标是否合法
if (x <= 3 && x > 0 && y <= 3 && y > 0)
{
if (board[x - 1][y - 1] == ' ')
{
board[x - 1][y - 1] = '*';
break;
}
else
{
printf("坐标被占用,不能下棋,请选择其他位置\n");
}
}
else
{
printf("坐标非法,请重新输入\n");
}
}
}
电脑下棋
//电脑下棋
void ComputerMove(char board[ROW][COL], int row, int col)
{
while (1)
{
int x = rand() % row;
int y = rand() % col;
if (board[x][y] == ' ')
{
board[x][y] = '#';
break;
}
}
}

判断输赢

//版本1.0枚举
//玩家赢返回"*",电脑赢返回""#,棋盘满了返回"Q"
char DetermineEnd1(char board[ROW][COL])
{
//玩家赢的情况
if ((board[0][0] == board[0][1] && board[0][1] == board[0][2]&&board[0][0]=='*')
|| (board[1][0] == board[1][1] && board[1][1] == board[1][2] && board[1][0] == '*')
|| (board[2][0] == board[2][1] && board[2][1] == board[2][2] && board[2][0] == '*')
|| (board[0][0] == board[1][0] && board[1][0] == board[2][0]&&board[0][0] == '*')
|| (board[0][1] == board[1][1] && board[1][1] == board[2][1] && board[0][1] == '*')
|| (board[0][2] == board[1][2] && board[1][2] == board[2][2] && board[0][2] == '*')
|| (board[0][0] == board[1][1] && board[1][1] == board[2][2] && board[0][0] == '*')
|| (board[0][2] == board[1][1] && board[1][1] == board[2][0] && board[0][2] == '*'))
{
return '*';
}
//电脑赢的情况
else if ((board[0][0] == board[0][1] && board[0][1] == board[0][2]&&board[0][0]=='#')
|| (board[1][0] == board[1][1] && board[1][1] == board[1][2] && board[1][0] == '#')
|| (board[2][0] == board[2][1] && board[2][1] == board[2][2] && board[2][0] == '#')
|| (board[0][0] == board[1][0] && board[1][0] == board[2][0]&&board[0][0] == '#')
|| (board[0][1] == board[1][1] && board[1][1] == board[2][1] && board[0][1] == '#')
|| (board[0][2] == board[1][2] && board[1][2] == board[2][2] && board[0][2] == '#')
|| (board[0][0] == board[1][1] && board[1][1] == board[2][2] && board[0][0] == '#')
|| (board[0][2] == board[1][1] && board[1][1] == board[2][0] && board[0][02] == '#'))
{
return '#';
}
else
{
//判断棋盘是否满了
for (int i = 0; i < ROW; i++)
{
for (int j = 0; j < COL; j++)
{
if (board[i][j] == ' ')
return '0';
}
}
}
//程序走到这里就说明没有分出胜负,而且棋盘已经满了,故为和局
return 'Q';
}
//版本2.0循环
// 判断游戏是否结束 玩家赢返回"*",电脑赢返回"#",棋盘满了返回"Q"
char DetermineEnd2(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][1] == board[i][2] && board[i][1] != ' '))
{
return board[i][1];
}
}
//判断列
for (i = 0; i < row; i++)
{
if ((board[0][i] == board[1][i] && board[1][i] == board[2][i] && board[1][i] != ' '))
{
return board[1][i];
}
}
//判断对角
if (board[0][0] == board[1][1] && board[1][1] == board[2][2] && board[1][1] != ' ')
{
return board[1][1];
}
if (board[0][2] == board[1][1] && board[1][1] == board[2][0] && board[1][1] != ' ')
{
return board[1][1];
}
//判断棋盘是否满了
for (int i = 0; i < ROW; i++)
{
for (int j = 0; j < COL; j++)
{
//其中有一个空格就说明还没满,返回"0"
if (board[i][j] == ' ')
return '0';
}
}
//程序走到这里就说明没有分出胜负,而且棋盘已经满了,故为和局
return 'Q';
}
小结语

text.c文件
#define _CRT_SECURE_NO_WARNINGS
#include"game.h"
void menu()
{
printf("******************************\n");
printf("******* 1. play 0. exit*****\n");
printf("******************************\n");
}
void game()
{
char board[ROW][COL] = { 0 };
//先初始化棋盘
InitBoard(board, ROW, COL);
//打印棋盘让玩家下棋
BoardPrint(board, ROW, COL);
char ret;
while (1)
{
printf("玩家下棋\n");
PlayerMove(board, ROW, COL);
ret= DetermineEnd2(board,ROW,COL);
if (ret != '0')
{
break;
}
BoardPrint(board, ROW, COL);
printf("电脑下棋\n");
ComputerMove(board, ROW, COL);
ret = DetermineEnd2(board, ROW, COL);
if (ret != '0')
{
break;
}
BoardPrint(board, ROW, COL);
}
if (ret == '*')
{
printf("玩家赢\n");
}
else if (ret == '#')
{
printf("电脑赢\n");
}
else
{
printf("平局\n");
}
BoardPrint(board, ROW, COL);
}
int main()
{
//初始化随机值
srand((unsigned int)time(NULL));
//接收用户选择开始游戏,或者退出游戏的变量
int input = 0;
do
{
menu();
printf("请选择>:");
scanf("%d", &input);
switch (input)
{
case 1:
game();
break;
case 0:
printf("退出成功\n");
break;
default:
printf("无此选项,请重新选择\n");
break;
}
} while (input);
return 0;
}
game.c文件
#define _CRT_SECURE_NO_WARNINGS
#include"game.h"
//初始化成空格
void InitBoard(char board[ROW][COL], int row, int col)
{
int i = 0;
int j = 0;
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
board[i][j] = ' ';
}
}
}
//打印棋盘
void BoardPrint(char board[ROW][COL], int row, int col)
{
int i = 0;
int j = 0;
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
printf(" %c ",board[i][j]);
if(j<col-1)
printf("|");
}
printf("\n");
for (j = 0; j < col; j++)
{
printf("---");
if (j < col - 1)
printf("|");
}
printf("\n");
}
}
void PlayerMove(char board[ROW][COL], int row, int col)
{
while (1)
{
printf("请输入坐标>:");
int x = 0;
int y = 0;
scanf("%d %d", &x, &y);
//判断坐标是否合法
if (x <= 3 && x > 0 && y <= 3 && y > 0)
{
if (board[x - 1][y - 1] == ' ')
{
board[x - 1][y - 1] = '*';
break;
}
else
{
printf("坐标被占用,不能下棋,请选择其他位置\n");
}
}
else
{
printf("坐标非法,请重新输入\n");
}
}
}
//电脑下棋
void ComputerMove(char board[ROW][COL], int row, int col)
{
while (1)
{
int x = rand() % row;
int y = rand() % col;
if (board[x][y] == ' ')
{
board[x][y] = '#';
break;
}
}
//}
////版本1.0
////玩家赢返回"*",电脑赢返回""#,棋盘满了返回"Q"
//char DetermineEnd1(char board[ROW][COL])
//{
// //玩家赢的情况
// if ((board[0][0] == board[0][1] && board[0][1] == board[0][2]&&board[0][0]=='*')
// || (board[1][0] == board[1][1] && board[1][1] == board[1][2] && board[1][0] == '*')
// || (board[2][0] == board[2][1] && board[2][1] == board[2][2] && board[2][0] == '*')
// || (board[0][0] == board[1][0] && board[1][0] == board[2][0]&&board[0][0] == '*')
// || (board[0][1] == board[1][1] && board[1][1] == board[2][1] && board[0][1] == '*')
// || (board[0][2] == board[1][2] && board[1][2] == board[2][2] && board[0][2] == '*')
// || (board[0][0] == board[1][1] && board[1][1] == board[2][2] && board[0][0] == '*')
// || (board[0][2] == board[1][1] && board[1][1] == board[2][0] && board[0][2] == '*'))
// {
//
// return '*';
// }
// //电脑赢的情况
// else if ((board[0][0] == board[0][1] && board[0][1] == board[0][2]&&board[0][0]=='#')
// || (board[1][0] == board[1][1] && board[1][1] == board[1][2] && board[1][0] == '#')
// || (board[2][0] == board[2][1] && board[2][1] == board[2][2] && board[2][0] == '#')
// || (board[0][0] == board[1][0] && board[1][0] == board[2][0]&&board[0][0] == '#')
// || (board[0][1] == board[1][1] && board[1][1] == board[2][1] && board[0][1] == '#')
// || (board[0][2] == board[1][2] && board[1][2] == board[2][2] && board[0][2] == '#')
// || (board[0][0] == board[1][1] && board[1][1] == board[2][2] && board[0][0] == '#')
// || (board[0][2] == board[1][1] && board[1][1] == board[2][0] && board[0][02] == '#'))
// {
//
// return '#';
// }
// else
// {
// //判断棋盘是否满了
// for (int i = 0; i < ROW; i++)
// {
// for (int j = 0; j < COL; j++)
// {
// if (board[i][j] == ' ')
// return '0';
// }
// }
// }
// //程序走到这里就说明没有分出胜负,而且棋盘已经满了,故为和局
// return 'Q';
//}
//版本2.0
// 判断游戏是否结束 玩家赢返回"*",电脑赢返回"#",棋盘满了返回"Q"
char DetermineEnd2(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][1] == board[i][2] && board[i][1] != ' '))
{
return board[i][1];
}
}
//判断列
for (i = 0; i < row; i++)
{
if ((board[0][i] == board[1][i] && board[1][i] == board[2][i] && board[1][i] != ' '))
{
return board[1][i];
}
}
//判断对角
if (board[0][0] == board[1][1] && board[1][1] == board[2][2] && board[1][1] != ' ')
{
return board[1][1];
}
if (board[0][2] == board[1][1] && board[1][1] == board[2][0] && board[1][1] != ' ')
{
return board[1][1];
}
//判断棋盘是否满了
for (int i = 0; i < ROW; i++)
{
for (int j = 0; j < COL; j++)
{
//其中有一个空格就说明还没满,返回"0"
if (board[i][j] == ' ')
return '0';
}
}
//程序走到这里就说明没有分出胜负,而且棋盘已经满了,故为和局
return 'Q';
}
game.h
#pragma once
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#define ROW 3 //行
#define COL 3 //列
//初始化棋盘
void InitBoard(char board[ROW][COL], int row, int col);
//打印棋盘
void BoardPrint(char board[ROW][COL], int row, int col);
//玩家下棋
void PlayerMove(char board[ROW][COL], int row, int col);
//电脑下棋
void ComputerMove(char board[ROW][COL], int row, int col);
// 版本1.0 判断游戏是否结束 玩家赢返回"*",电脑赢返回"#",棋盘满了返回"Q"
char DetermineEnd1(char board[ROW][COL]);
//版本2.0 判断游戏是否结束 玩家赢返回"*",电脑赢返回"#",棋盘满了返回"Q"
char DetermineEnd2(char board[ROW][COL],int row,int col);
边栏推荐
猜你喜欢
随机推荐
Challenge LeetCode1000 questions in 365 days - Day 047 Design Circular Queue Circular Queue
X86函数调用模型分析
LayaBox---TypeScript---Decorator
深度学习100例 —— 卷积神经网络(CNN)实现mnist手写数字识别
sqlmap安装教程用w+r打开(sqlyog安装步骤)
Three.JS程序化建模入门
LayaBox---TypeScript---Iterator and generator
R language time series data arithmetic operation: use the log function to log the time series data, and use the diff function to calculate the successive difference of the logarithmic time series data
LayaBox---TypeScript---迭代器和生成器
暑期总结3
After 21 years of graduation, I switched to software testing. From 0 income to a monthly salary of over 10,000, I am really lucky...
The ggbarplot function of the R language ggpubr package visualizes the grouped histogram, sets the add parameter to mean_se to visualize the histogram of the mean values of different levels and adds
Deep Learning 100 Examples - Convolutional Neural Network (CNN) for mnist handwritten digit recognition
windbg分析进程卡死
SVN如何删除文件名包含空格的文件
小几届的学弟问我,软件测试岗是选11k的华为还是20k的小公司,我直呼受不了,太凡尔赛了~
wireshark的安装教程(暖气片安装方法图解)
21年毕业转行软件测试,从0收入到月薪过万,我真的很幸运...
R language ggplot2 visualization: based on the fill parameter and shape parameter in the aes function, custom draw a grouped line chart and add data points (scatter points), use the legend.position fu
Unknown content monitoring