三子棋小游戏的实现

#define  _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<windows.h>

void print(int chess[][3])		//打印棋盘
{
	int i = 0;
	int j = 0;
	system("cls");
	printf("======================三子棋游戏=======================\n");
	for (i = 0; i < 3; i++)
	{
		printf("\n			");
		for (j = 0; j < 3; j++)
		{
			if (chess[i][j] == 1)
				printf("X  ");
			else if (chess[i][j] == 0)
				printf("_  ");
			else
				printf("0  ");
		}
		printf("\n");
	}
	printf("\n");
	printf("========================================================\n");
}

void player(int chess[][3])		//玩家落子
{
	int x = 0;
	int y = 0;
	do
	{
		printf("请输入您落子的坐标: ");
		scanf("%d %d", &x, &y);
		if (chess[x][y] != 0)
			printf("输入有误,请重新输入!\n");
	} while (chess[x][y] != 0);
	chess[x][y] = 1;
}

void computer(int chess[][3])		//电脑落子
{
	int x = 0;
	int y = 0;
	do
	{
		srand((unsigned)time(NULL));
		x = rand() % 3;
		y = rand() % 3;
	} while (chess[x][y] != 0);
	chess[x][y] = 2;
}

int check_winner(int chess[][3])		//判断胜负
{
	int flag = 0;
	int x = 0;
	int y = 0;
	if ((chess[0][0] == chess[0][1]) && (chess[0][1] == chess[0][2]))
	{
		if (chess[0][0] == 1)
			return 1;
		else if (chess[0][0] == 2)
			return 2;
	}
	if ((chess[1][0] == chess[1][1]) && (chess[1][1]) == chess[1][2])
	{
		if (chess[1][0] == 1)
			return 1;
		else if (chess[1][0] == 2)
			return 2;
	}
	if ((chess[2][0] == chess[2][1]) && (chess[2][1]) == chess[2][2])
	{
		if (chess[2][0] == 1)
			return 1;
		else if (chess[2][0] == 2)
			return 2;
	}
	if ((chess[0][0] == chess[1][0]) && (chess[1][0]) == chess[2][0])
	{
		if (chess[0][0] == 1)
			return 1;
		else if (chess[0][0] == 2)
			return 2;
	}
	if ((chess[0][1] == chess[1][1]) && (chess[1][1]) == chess[2][1])
	{
		if (chess[0][1] == 1)
			return 1;
		else if (chess[0][1] == 2)
			return 2;
	}
	if ((chess[0][2] == chess[1][2]) && (chess[1][2]) == chess[2][2])
	{
		if (chess[0][2] == 1)
			return 1;
		else if (chess[0][2] == 2)
			return 2;
	}
	if ((chess[0][0] == chess[1][1]) && (chess[1][1]) == chess[2][2])
	{
		if (chess[0][0] == 1)
			return 1;
		else if (chess[0][0] == 2)
			return 2;
	}
	if ((chess[0][2] == chess[1][1]) && (chess[1][1]) == chess[2][0])
	{
		if (chess[0][2] == 1)
			return 1;
		else if (chess[0][2] == 2)
			return 2;
	}

	for (x = 0; x < 3; x++)
	{
		for (y = 0; y < 3; y++)
		{
			if (chess[x][y] == 0)
				return 0;
		}
	}
	return -1;
}
int grade(int chess[][3])
{
	int x = 0;
	int y = 0;
	int sum_grade = 0;
	for (x = 0; x < 3; x++)
	{
		for (y = 0; y < 3; y++)
		{
			if (chess[x][y] == 0)
				sum_grade++;
		}
	}
	return sum_grade;
}
void play()
{
	int chess[3][3] = { 0 };
	int winner = 0;
	print(chess);
	while (check_winner(chess) == 0)
	{
		player(chess);
		print(chess);
		if (check_winner(chess) != 0)
			break;
		computer(chess);
		print(chess);
		Sleep(1000);
	}
	winner = check_winner(chess);
	if (winner == 1)
	{
		printf("恭喜,您胜了!\n");
	}
	else if (winner == 2)
	{
		printf("很遗憾,您输了。\n");
	}
	else
	{
		printf("平局!\n");
	}
}

int main()
{
	int have_fun = 1;
	do
	{
		play();
		printf("\n输入1继续游戏: ");
		scanf("%d", &have_fun);
	} while (have_fun == 1);
	return 0;
}

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值