26颜色方块（2）41（3）56（4）

最新推荐文章于 2021-12-05 19:57:24 发布

csuzhucong

最新推荐文章于 2021-12-05 19:57:24 发布

阅读量3.4k

点赞数 1

本文链接：https://blog.csdn.net/nameofcsdn/article/details/52966024

版权

智力游戏

26颜色方块（2）

规则和14颜色方块（1）不太一样，那个不能旋转，这个是可以旋转的。

但是思路还是差不多，无非就是在枚举的时候加了旋转数，有4种。

所以代码是直接用那个代码修改得到，最主要的修改是将 2 维数组改成 3 维数组，第三个下标是需要旋转几次。

代码：

#include<iostream>
#include<iomanip>
using namespace std;

char list[12][4][4];
int i, ni, j, nj, k, nk, l, nl;
int ri, nri, rj, nrj, rk, nrk, rl, nrl;

int notBeLine(int i, int j, int ni, int nj)
{
	if (list[i][2][ni] == list[j][0][nj] && list[i][3][ni] == list[j][1][nj])return 0;
	return 1;
}

int notBeRow(int i, int j, int ni, int nj)
{
	if (list[i][1][ni] == list[j][0][nj] && list[i][3][ni] == list[j][2][nj])return 0;
	return 1;
}

int same(int i, int j, int k, int l, int x)
{
	if (i == x || j == x || k == x || l == x)return 1;
	return 0;
}

bool main2();
bool main3();

int main()
{	
	cout << "输入每个格子的4个点的颜色，用任何字符代表颜色都可以" << endl;
	for (int i = 0; i < 12; i++)
	{
		for (int j = 0; j < 4; j++)cin >> list[i][j][0];
		for (int temp = 1; temp < 4; temp++)
		{
			list[i][1][temp] = list[i][0][temp - 1];
			list[i][2][temp] = list[i][3][temp - 1];
			list[i][3][temp] = list[i][1][temp - 1];
			list[i][0][temp] = list[i][2][temp - 1];
		}
	}

	for (i = 0; i < 12; i++)for (ni = 0; ni < 4; ni++)
	for (j = 0; j < 12; j++)for (nj = 0; nj < 4; nj++)
	{
		if (i == j || (notBeLine(i, j, ni, nj)))continue;
		for (k = 0; k < 12; k++)for (nk = 0; nk < 4; nk++)
		{
			if (i == k || j == k || (notBeLine(j, k, nj, nk)))continue;
			for (l = 0; l < 12; l++)for (nl = 0; nl < 4; nl++)
			{
				if (i == l || j == l || k == l)continue;
				if (notBeLine(k, l, nk, nl))continue;
				if (main2())return 0;
			}
		}
	}
	return 0;
}

bool main2()
{
	for (ri = 0; ri < 12; ri++)for (nri = 0; nri < 4; nri++)
	{
		if (notBeRow(i, ri, ni, nri) || same(i, j, k, l, ri))continue;
		for (rj = 0; rj < 12; rj++)for (nrj = 0; nrj < 4; nrj++)
		{
			if (notBeRow(j, rj, nj, nrj) || same(i, j, k, l, rj))continue;
			if (ri == rj || (notBeLine(ri, rj, nri, nrj)))continue;
			for (rk = 0; rk < 12; rk++)for (nrk = 0; nrk < 4; nrk++)
			{
				if (notBeRow(k, rk, nk, nrk) || same(i, j, k, l, rk))continue;
				if (ri == rk || rj == rk || (notBeLine(rj, rk, nrj, nrk)))continue;
				for (rl = 0; rl < 12; rl++)for (nrl = 0; nrl < 4; nrl++)
				{
					if (notBeRow(l, rl, nl, nrl) || same(i, j, k, l, rl))continue;
					if (ri == rl || rj == rl || rk == rl || notBeLine(rk, rl, nrk, nrl))continue;
					if (main3())return true;
				}
			}
		}
	}
	return false;
}

bool main3()
{
	for (int j1 = 0; j1 < 12; j1++)for (int nj1 = 0; nj1 < 4; nj1++)
	{
		if (same(i, j, k, l, j1) || same(ri, rj, rk, rl, j1) || notBeRow(j1, j, nj1, nj))continue;
		for (int j2 = 0; j2 < 12; j2++)for (int nj2 = 0; nj2 < 4; nj2++)
		{
			if (same(i, j, k, l, j2) || same(ri, rj, rk, rl, j2) || notBeRow(rj, j2, nrj, nj2))continue;
			for (int k1 = 0; k1 < 12; k1++)for (int nk1 = 0; nk1 < 4; nk1++)
			{
				if (same(i, j, k, l, k1) || same(ri, rj, rk, rl, k1) || notBeRow(k1, k, nk1, nk))continue;
				if (j1 == j2 || j2 == k1 || k1 == j1)continue;
				for (int k2 = 0; k2 < 12; k2++)for (int nk2 = 0; nk2 < 4; nk2++)
				{
					if (same(i, j, k, l, k2) || same(ri, rj, rk, rl, k2) || notBeRow(rk, k2, nrk, nk2))continue;
					if (j1 == k2 || j2 == k2 || k1 == k2)continue;
					if (notBeLine(j1, k1, nj1, nk1) || notBeLine(j2, k2, nj2, nk2))continue;
					cout << "      " << setw(4) << i + 1 << setw(2) << ni << setw(4) << ri + 1 << setw(2) << nri << endl;
					cout << setw(4) << j1 + 1 << setw(2) << nj1 << setw(4) << j + 1 << setw(2) << nj << setw(4) << rj + 1 << setw(2) << nrj << setw(4) << j2 + 1 << setw(2) << nj2 << endl;
					cout << setw(4) << k1 + 1 << setw(2) << nk1 << setw(4) << k + 1 << setw(2) << nk << setw(4) << rk + 1 << setw(2) << nrk << setw(4) << k2 + 1 << setw(2) << nk2 << endl;
					cout << "      " << setw(4) << l + 1 << setw(2) << nl << setw(4) << rl + 1 << setw(2) << nrl << endl << endl;
					system("pause>nul");
					return true;
				}
			}
		}
	}
	return false;
}