用C语言实现简单的三子棋游戏

目录

1 -> 模块简介

2 -> test.c

3 -> game.c

4 -> game.h



1 -> 模块简介

test.c:测试游戏逻辑

game.c: 函数的实现

game.h:函数的声明

2 -> test.c

#define _CRT_SECURE_NO_WARNINGS 1

#include "game.h";

void menu()
{
	printf("****************************************\n");
	printf("************     1.play     ************\n");
	printf("************     0.exit     ************\n");
	printf("****************************************\n");
}

void game()
{
	//存放数据
	char board[ROW][COL] = { 0 };

	//初始化
	InitBoard(board, ROW, COL);

	//打印棋盘
	DisplayBoard(board, ROW, COL);

	char ret = 0;
	while (1)
	{
		//玩家下棋
		PlayerMove(board, ROW, COL);
		//打印棋盘
		DisplayBoard(board, ROW, COL);
		//判断输赢
		ret = IsWin(board, ROW, COL);
		if ('C' != ret)
			break;

		//电脑下棋
		ComputerMove(board, ROW, COL);
		//打印棋盘
		DisplayBoard(board, ROW, COL);
		//判断输赢
		ret = IsWin(board, ROW, COL);
		if ('C' != ret)
			break;
	}
	if ('*' == ret)
		printf("恭喜玩家获得胜利!!!\n");
	else if ('#' == ret)
		printf("恭喜电脑获得胜利!!!\n");
	else if ('Q' == ret)
		printf("双方平局\n");
}

int main()
{
	int input = 0;
	srand((unsigned int) time(NULL));
	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;
}

3 -> game.c

#define _CRT_SECURE_NO_WARNINGS 1

#include "game.h";

//初始化棋盘
void InitBoard(char board[ROW][COL], int row, int col)
{
	memset(&board[0][0], ' ', row * col * sizeof(board[0][0]));
}

//打印棋盘
void DisplayBoard(char board[ROW][COL], int row, int col)
{
	for (int i = 0; i < row; i++)
	{
		for (int j = 0; j < col; j++)
		{
			printf(" %c ", board[i][j]);
			if (j < col - 1)
				printf("|");
		}
		printf("\n");
		if (i < row - 1)
		{
			for (int 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 = 0;
	int y = 0;

	while (1)
	{
		printf("请玩家下棋->\n");
		printf("请输入所在坐标:>");
		scanf("%d %d", &x, &y);

		if (x >= 1 && x <= row && y >= 1 && y <= col)
		{
			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)
{
	int x = 0;
	int y = 0;
	printf("电脑下棋->\n");

	while (1)
	{
		x = rand() % row;
		y = rand() % col;
		if (board[x][y] == ' ')
		{
			board[x][y] = '#';
			break;
		}
	}
}

//棋盘填满平局
int IsFull(char board[ROW][COL], int row, int col)
{
	for (int i = 0; i < row; i++)
	{
		for (int j = 0; j < col; j++)
		{
			if (board[i][j] == ' ')
				return 0;
		}
	}
	return 1;
}

//判断输赢
//玩家赢 -> *
//电脑赢 -> #
//平局 -> Q
//继续 -> C
char IsWin(char board[ROW][COL], int row, int col)
{
	//行判断
	for (int i = 0; i < row; i++)
	{
		if (board[i][0] == board[i][1] && board[i][1] == board[i][2] && board[i][0] != ' ')
			return board[i][0];
	}

	//列判断
	for (int i = 0; i < col; i++)
	{
		if (board[0][i] == board[1][i] && board[1][i] == board[2][i] && board[0][i] != ' ')
			return board[0][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];

	//平局判断
	if (IsFull(board, row, col))
		return 'Q';
	return 'C';
}

4 -> game.h

#pragma once
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>

#define ROW 3
#define COL 3

//初始化棋盘
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);

//棋盘填满平局
int IsFull(char board[ROW][COL], int row, int col);

//判断输赢
char IsWin(char board[ROW][COL], int row, int col);

好久没写博客啦,以后会花更多时间写博客的,感谢各位大佬支持啦!!!

相关推荐

最近更新

  1. TCP协议是安全的吗?

    2024-01-21 14:38:01       18 阅读
  2. 阿里云服务器执行yum,一直下载docker-ce-stable失败

    2024-01-21 14:38:01       19 阅读
  3. 【Python教程】压缩PDF文件大小

    2024-01-21 14:38:01       19 阅读
  4. 通过文章id递归查询所有评论(xml)

    2024-01-21 14:38:01       20 阅读

热门阅读

  1. docker 部署 springboot 2.6.13 jar包流程笔记

    2024-01-21 14:38:01       37 阅读
  2. 191. 位1的个数

    2024-01-21 14:38:01       34 阅读
  3. ElasticSearch 7.x现网运行问题汇集2

    2024-01-21 14:38:01       32 阅读
  4. [LeetCode]-动态规划-4

    2024-01-21 14:38:01       28 阅读
  5. 单例模式实现及优化(C++11)

    2024-01-21 14:38:01       31 阅读
  6. Zephyr 学习笔记(一)

    2024-01-21 14:38:01       34 阅读
  7. list下

    list下

    2024-01-21 14:38:01      26 阅读