C++实现五子棋(自动判胜负)

话不多说,直接上代码。 

#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#include <windows.h>
using namespace std;
int qipan[20][20]; 
int check()
{
	int flag = 100;
	for(int i = 1; i <= 19; i++)
	{
		for(int j = 1; j <= 19; j++)
		{
			if(qipan[i][j] == 1)
			{
				if((qipan[i][j] == 1 && qipan[i + 1][j] == 1 && qipan[i + 2][j] == 1 && qipan[i + 3][j] == 1 && qipan[i + 4][j] == 1) ||
				 	(qipan[i][j] == 1 && qipan[i][j + 1] == 1 && qipan[i][j + 2] == 1 && qipan[i][j + 3] == 1 && qipan[i][j + 4] == 1)||
				 	(qipan[i][j] == 1 && qipan[i + 1][j + 1] == 1 && qipan[i + 2][j + 2] == 1 && qipan[i + 3][j + 3] == 1 && qipan[i + 4][j + 4] == 1)||
					(qipan[i][j] == 1 && qipan[i - 1][j - 1] == 1 && qipan[i - 2][j - 2] == 2 && qipan[i - 3][j - 3] == 2 && qipan[i - 4][j - 4] == 2))
				{
					flag = 1;
					return flag;
				}
				else flag = 100;
			}
			if(qipan[i][j] == 2)
			{
				if((qipan[i][j] == 2 && qipan[i + 1][j] == 2 && qipan[i + 2][j] == 2 && qipan[i + 3][j] == 2 && qipan[i + 4][j] == 2) ||
				 	(qipan[i][j] == 2 && qipan[i][j + 1] == 2 && qipan[i][j + 2] == 2 && qipan[i][j + 3] == 2 || qipan[i][j + 4] == 2)||
				 	(qipan[i][j] == 2 && qipan[i + 1][j + 1] == 2 && qipan[i + 2][j + 2] == 2 && qipan[i + 3][j + 3] == 2 && qipan[i + 4][j + 4] == 2)||
					(qipan[i][j] == 2 && qipan[i - 1][j - 1] == 2 && qipan[i - 2][j - 2] == 2 && qipan[i - 3][j - 3] == 2 && qipan[i - 4][j - 4] == 2))
				{
					flag = 2;
					return flag;
				}
				else flag = 100;
			}
		}
	}
	return flag;
}
void print()
{
	printf("注意:1为黑方,2为白方!!!\n");
	for(int i = 1; i <= 19; i++)
	{
		for(int j = 1; j <= 19; j++)
		{
			cout << qipan[i][j] << " ";
		}
		cout << endl;
	}
}
int main()
{
	SetConsoleTitle("cyr出品:五子棋游戏");
	printf("c");Sleep(800);
	printf("y");Sleep(800);
	printf("r");Sleep(800);
	printf("出");Sleep(800);
	printf("品");Sleep(800);
	printf(":");Sleep(800);
	printf("五");Sleep(800);
	printf("子");Sleep(800);
	printf("棋");Sleep(800);
	printf("游");Sleep(800);
	printf("戏");Sleep(800);
	printf(".");Sleep(800);
	printf(".");Sleep(800);
	printf(".");Sleep(800);
	cout << endl; 
	printf("注意:1为黑方,2为白方!!!\n");
//	printf("请选择您喜欢的颜色:1.黑色2.白色\n");
//	int jjj;
//	cin >> jjj;
//	if(jjj == 1) system("color 0F");
//	else system("color F0");
	system("pause");
	while(1)
	{
		system("cls");
		system("color 0F");
		print();
		int u, v;
		cout << "黑方下棋" << endl;
		cin >> u >> v;
		if(qipan[u][v] != 0 || u > 19 || v > 19)
		{
			while(qipan[u][v] != 0 || u > 19 || v > 19)
			{
				cout << "您犯规了,请重新下" << endl;
				cin >> u >> v;
			}
		}
		qipan[u][v] = 1;
		if(check() == 1 || check() == 2) 
		{
			if(check() == 1) cout << "黑方胜利" << endl;
			else cout << "白方胜利" << endl;
			return 0;
		}
		system("cls");
		system("color F0");
		print();
		cout << "白方下棋" << endl;
		cin >> u >> v;
		if(qipan[u][v] != 0 || u > 19 || v > 19)
		{
			while(qipan[u][v] != 0 || u > 19 || v > 19)
			{
				cout << "您犯规了,请重新下" << endl;
				cin >> u >> v;
			}
		}
		qipan[u][v] = 2;
		if(check() == 1 || check() == 2) 
		{
			if(check() == 1) cout << "黑方胜利" << endl;
			else cout << "白方胜利" << endl;
			return 0;
		}
	}
	return 0;
}

运行效果如下:

 

希望你能喜欢 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值