#include <iostream>=
using namespace std;
const int nGridCount = 8;
int s_color[nGridCount][nGridCount] = {
34, 92, 26, 34, 93, 10, 34, 39,
10, 10, 34, 39, 15, 15, 39, 93,
15, 26, 26, 93, 93, 39, 10, 15,
26, 34, 39, 15, 39, 34, 34, 26,
34, 39, 39, 34, 52, 26, 10, 10,
26, 34, 10, 15, 52, 52, 15, 39,
93, 15, 26, 26, 15, 39, 93, 93,
34, 52, 93, 10, 93, 10, 39, 26
};
#define OUTPUT_PAIR(x1, y1, x2, y2) printf("(%d, %d), (%d, %d)\n", x1, y1, x2, y2);\
printf("%d %d\n", s_color[x1][y1], s_color[x2][y2])
int main()
{
// 横向地检查一遍
for (int i = 0; i < nGridCount; i++)
{
for (int j = 0; j < nGridCount - 1; j++)
{
// xx | x | xx | x | x xx | xx x
// x | xx | x | xx | | 这些情况的处理
if ( s_color[i][j] == s_color[i][j+1])
{
// ?
对对碰(宝石迷阵 Bejeweled)游戏求解算法
最新推荐文章于 2024-08-12 16:46:12 发布
该博客详细介绍了对对碰(宝石迷阵Bejeweled)游戏的求解算法,通过遍历棋盘的横向和纵向,检查相邻的宝石颜色,寻找并输出匹配对。算法涉及到不同场景的处理,如相邻两格、三格的宝石匹配,并使用OUTPUT_PAIR宏来打印匹配位置和颜色。
摘要由CSDN通过智能技术生成