三子棋/井字棋(C语言)
目录
game.h如下:
game.c如下:
text.c如下:
这个游戏需要用到三个文件
game.h头文件用来申明函数和导包
game.h如下:
#pragma once
#define ROW 3
#define COL 3
#include
#include
#include
//初始化棋盘的函数
void InitBoard(char board[ROW][COL], int row, int col);
//打印棋盘的函数
void DisplayBoard(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);
//玩家赢返回”w”
//电脑赢返回”c”
//平局返回”q”
//继续返回”a”
char Iswin(char board[ROW][COL], int row, int col);
//判断棋盘是否已经满了
int IsFull(char board[ROW][COL], int row, int col);
game.c如下:
#define _CRT_SECURE_NO_WARNINGS
#include “game.h”
#include
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 DisplayBoard(char board[ROW][COL], int row, int col)
{
int i = 0;
for (i = 0; i < row; i++)
{
//打印数据
int j = 0;
for (j = 0; j < col; j++)
{
printf(” %c “, board[i][j]);
if (j < col – 1)
printf(“|”);
}
printf(“\n”);
//打印分割行
if (i != row – 1)
{
int j = 0;
for (j = 0; j < col; j++) {
printf(“—“);
if (j < col – 1)
printf(“|”);
}
printf(“\n”);
}
}
}
void PlayerMove(char board[ROW][COL], int row, int col) {
int x;
int y;
while (1)
{
printf(“玩家下棋>\n”);
printf(“请输入坐标,坐标格式为 x y \n”);
scanf(“%d%d”, &x, &y);
if ((x > 0 && x 0 && y <= col)) {
if (board[x – 1][y – 1] != ‘ ‘) {
printf(“此坐标已经被占用,请重新输入\n”);
continue;
}
board[x – 1][y – 1] = ‘w’;
break;
}
else
{
printf(“输入的坐标不合法,请重新输入\n”);
continue;
}
}
}
void ComputerMove(char board[ROW][COL], int row, int col) {
printf(“电脑下棋>\n”);
int x = 0;
int y = 0;
//抢占天元
if (board[1][1] == ‘ ‘) {
board[1][1] = ‘c’;
return;
}
//抢先赢
int i = 0;
for (i = 0; i < row; i++) {
if (board[i][0] == board[i][1] && board[i][0] == ‘c’ && board[i][2] == ‘ ‘) {
board[i][2] = ‘c’;
return;
}
else if (board[i][1] == board[i][2] && board[i][1] == ‘c’ && board[i][0] == ‘ ‘) {
board[i][0] = ‘c’;
return;
}
else if (board[i][0] == board[i][2] && board[i][0] == ‘c’ && board[i][1] == ‘ ‘) {
board[i][1] = ‘c’;
return;
}
}
for (i = 0; i < col; i++) {
if (board[0][i] == board[1][i] && board[0][i] == ‘c’ && board[2][i] == ‘ ‘) {
board[2][i] = ‘c’;
return;
}
else if (board[1][i] == board[2][i] && board[1][i] == ‘c’ && board[0][i] == ‘ ‘) {
board[0][i] = ‘c’;
return;
}
else if (board[0][i] == board[2][i] && board[0][i] == ‘c’ && board[1][i] == ‘ ‘)
{
board[1][i] = ‘c’;
return;
}
}
if (board[0][0] == board[1][1] && board[1][1] == ‘c’ && board[2][2] == ‘ ‘) {
board[2][2] = ‘c’;
return;
}
if (board[2][2] == board[1][1] && board[1][1] == ‘c’ && board[0][0] == ‘ ‘) {
board[0][0] = ‘c’;
return;
}
if (board[2][2] == board[0][0] && board[0][0] == ‘c’ && board[1][1] == ‘ ‘) {
board[1][1] = ‘c’;
return;
}
if (board[1][1] == board[0][2] && board[1][1] == ‘c’ && board[2][0] == ‘ ‘) {
board[2][0] = ‘c’;
return;
}
if (board[1][1] == board[2][0] && board[1][1] == ‘c’ && board[0][2] == ‘ ‘) {
board[0][2] = ‘c’;
return;
}
if (board[0][2] == board[2][0] && board[0][2] == ‘c’ && board[1][1] == ‘ ‘) {
board[1][1] = ‘c’;
return;
}
//堵玩家,就是玩家有2个相连时要堵
//当玩家 行 有两个相连时堵
for (i = 0; i < row; i++) {
if (board[i][0] == board[i][1] && board[i][0] == ‘w’ && board[i][2] == ‘ ‘) {
board[i][2] = ‘c’;
return;
}
else if(board[i][1] == board[i][2] && board[i][1] == ‘w’ && board[i][0] == ‘ ‘){
board[i][0] = ‘c’;
return;
}
else if (board[i][0] == board[i][2] && board[i][0] == ‘w’ && board[i][1] == ‘ ‘) {
board[i][1] = ‘c’;
return;
}
}
//当玩家 列 有两个相连时堵
for (i = 0; i < col; i++) {
if (board[0][i] == board[1][i] && board[0][i] == ‘w’ && board[2][i] == ‘ ‘) {
board[2][i] = ‘c’;
return;
}else if (board[1][i] == board[2][i] && board[1][i] == ‘w’ && board[0][i] == ‘ ‘) {
board[0][i] = ‘c’;
return;
}
else if(board[0][i] == board[2][i] && board[0][i] == ‘w’ && board[1][i] == ‘ ‘)
{
board[1][i] = ‘c’;
return;
}
}
//当玩家 斜着的 有两个相连时堵
if (board[0][0] == board[1][1] && board[1][1] == ‘w’ && board[2][2] == ‘ ‘) {
board[2][2] = ‘c’;
return;
}
if (board[2][2] == board[1][1] && board[1][1] == ‘w’ && board[0][0] == ‘ ‘) {
board[0][0] = ‘c’;
return;
}
if (board[2][2] == board[0][0] && board[0][0] == ‘w’ && board[1][1] == ‘ ‘) {
board[1][1] = ‘c’;
return;
}
if (board[1][1] == board[0][2] && board[1][1] == ‘w’ && board[2][0] == ‘ ‘) {
board[2][0] = ‘c’;
return;
}
if (board[1][1] == board[2][0] && board[1][1] == ‘w’ && board[0][2] == ‘ ‘) {
board[0][2] = ‘c’;
return;
}
if (board[0][2] == board[2][0] && board[0][2] == ‘w’ && board[1][1] == ‘ ‘) {
board[1][1] = ‘c’;
return;
}
//随机乱下
while (1)
{
x = rand() % row;//0-2
y = rand() % col;//0-2
if (board[x][y] == ‘ ‘) {
board[x][y] = ‘c’;
break;
}
}
}
char Iswin(char board[ROW][COL], int row, int col) {
//行
int i = 0;
for (i = 0; i < row; i++) {
int i1 = 0;
char temp = board[i][i1];//每一行第一个元素记录到临时变量里
for (i1 = 1; i1 < col; i1++) {
if (temp != board[i][i1]) {
break;//一旦这一行有不同的就跳出这一行的判断
}
temp = board[i][i1];
if (temp == board[i][col – 1]&&temp!=’ ‘) {
return board[i][col – 1];//如果temp已经记录到这一行最后一个元素,那就说明这一行全部相等,返回结果
}
}
}
//列
int j = 0;
for (j = 0; j < col; j++) {
if (board[0][j] == board[1][j] && board[1][j] == board[2][j] && board[0][j] != ‘ ‘) {
return board[0][j];
}
}
//对角线
if (board[0][0] == board[1][1] && board[1][1] == board[2][2] && board[0][0] != ‘ ‘) {
return board[0][0];
}
if (board[0][2] == board[1][1] && board[1][1] == board[2][0] && board[0][2] != ‘ ‘) {
return board[0][2];
}
//平局
if (IsFull(board,row,col)) {
return ‘q’;
}
//继续
return ‘a’;
}
//判断棋盘是否已满
int IsFull(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++) {
if (board[i][j] == ‘ ‘) {
return 0;
}
}
}
return 1;
}
text.c如下:
#define _CRT_SECURE_NO_WARNINGS
#include
#include “game.h”
void menu() {
printf(“*******************\n”);
printf(“*****1.play********\n”);
printf(“*****0.exit********\n”);
printf(“*******************\n”);
}
void game() {
char flag;
char board[ROW][COL] = { 0 };
//初始化棋盘的功能
InitBoard(board, ROW, COL);
//打印棋盘
DisplayBoard(board, ROW, COL);
while (1)
{
//玩家下棋
PlayerMove(board, ROW, COL);
//打印棋盘
DisplayBoard(board, ROW, COL);
//判断玩家胜利
flag = Iswin(board, ROW, COL);
if (flag != ‘a’) {
break;
}
//电脑下棋
ComputerMove(board, ROW, COL);
//判断电脑胜利
flag = Iswin(board, ROW, COL);
if (flag != ‘a’) {
break;
}
//打印棋盘
DisplayBoard(board, ROW, COL);
}
if (flag == ‘w’) {
printf(“玩家赢\n”);
}
else if(flag == ‘c’)
{
printf(“电脑赢\n”);
}
else
{
printf(“平局\n”);
}
DisplayBoard(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;
}
本文来自网络，不代表协通编程立场，如若转载，请注明出处：https://net2asp.com/08215564d5.html
相关推荐
-
c++之二叉树【进阶版】
前言 在c语言阶段的数据结构系列中已经学习过二叉树，但是这篇文章是二叉树的进阶版，因为首先就会讲到一种树形结构“二叉搜索树”，学习二叉搜索树的目标是为了更好的理解m…
-
C语言排序算法
排序的过程就是增加有序度，减少逆序度，最终达到满有序度 冒泡排序 #include #include #define N 10 void swap(int arr[],int i,…
-
密码算法（SM1、SM2、SM3、SM4、同态加密、密态计算、隐私计算和安全多方计算）
文章目录 SM1 对称密码 SM2 椭圆曲线公钥密码算法 SM3 杂凑算法 SM4 对称算法 同态加密 密态计算和隐私计算 安全多方计算技术 安全多方计算的应用场景 对称加密算法 …
-
【数据结构】栈的使用|模拟实现|应用|栈与虚拟机栈和栈帧的区别
目录 一、栈(Stack) 1.1 概念 1.2 栈的使用 1.3 栈的模拟实现 1.4 栈的应用场景 1. 改变元素的序列 2. 将递归转化为循环 3. 括号匹配 4. 逆波兰表…
-
【贪心算法】LeetCode2071:你可以安排的最多任务数目
作者推荐 [二分查找]LeetCode2040:两个有序数组的第 K 小乘积 本文涉及的基础知识点 二分查找算法合集 题目 给你 n 个任务和 m 个工人。每个任务需要一定的力量值…
-
局部路径规划 DWA 算法完全解析（理论推导+代码实现，包你看懂！）
转载请注明出处，谢谢 理论基础 前面学习的全局路径规划方法，Dijkstra、Best-First-Search、A*算法都属于状态采样（State Sampling）方法，而 D…
-
C语言版数据结构-课程设计-航空客运订票系统 V2.0 附源码（增加管理员功能）
相信很多粉丝看过看过我的主页，有一个航空订票系统： 数据结构航空订票系统（附源码） 但是最近后台收到很多粉丝的要求，在上一个航空订票系统中要加上管理员的功能块，于是对上面那个课设进…
-
人工势场法路径规划算法（APF）
本文主要对人工势场法路径规划算法进行介绍，主要涉及人工势场法的简介、引力和斥力模型及其推导过程、人工势场法的缺陷及改进思路、人工势场法的Python与MATLAB开源源码等方…
-
力扣链表OJ面试题，那些你不懂的全新版本解法
孤独的时候看世界更清晰 前言 数据结构的逻辑性是非常强的，所以单单看代码很难搞懂，这里博主对每一道题目都进行了非常细致的图文详解，每一道题目都是非常经典的面试OJ题，每一道题我都…
-
【数据结构】如何用队列实现栈？图文详解（LeetCode）
LeetCode链接：225. 用队列实现栈 – 力扣（LeetCode） 本文默认读者已经掌握栈与队列的基本知识 或者先看我的另一篇博客：【数据结构】栈与队列_字节连…
