Qt 消去游戏(对对碰)实现及判断死锁算法

简单的消去游戏判断死锁算法,还有优化的余地.

 

用Qt做的消去游戏Demo

下载地址http://download.csdn.net/source/1922774

 

 

 

#include <iostream>#include <ctime>#include <cstdlib>using namespace std;const int BLOCKSIZE = 8;int mBlocks[8][8] = {{05, 10, 11, 9, 12, 16, 04, 00},{19, 03, 15, 12, 07, 16, 18, 19},{14, 9, 17, 9, 07, 10, 13, 9},{ 8, 04, 05, 16, 10, 16, 10, 16},{04, 04, 00, 19, 17, 10, 06, 14},{11, 02, 14, 13, 12, 10, 10, 11},{12, 06, 10, 15, 03, 16, 19, 9},{17, 8, 8, 06, 02, 03, 15, 8}};//随即地图--->测试使用void randomMap(){ srand(time(0)); for (int i = 0; i < BLOCKSIZE; i++) for (int j = 0; j < BLOCKSIZE; j++) mBlocks[i][j] = rand() % 5;}//交换数void swap(int& x, int& y){ int t = x; x = y; y = t;}/*A A BBABBAA此情况全部消去后,先落列在落行*/bool isOK(int x, int y){ bool ok = false; int i = x, j = x;//向上查找while (i > 0 && mBlocks[i - 1][y] == mBlocks[x][y])i--;//向下查找while (j < BLOCKSIZE - 1 && mBlocks[j + 1][y] == mBlocks[x][y])j++; //如果横向有3个连续的则返回true if (j - i >= 2){cout<<" ["<<i<<","<<y<<"]-->["<<j<<","<<y<<"] Cleared!"<<endl; ok = true;} i = y; j = y;//向左走while (i > 0 && mBlocks[x][i - 1] == mBlocks[x][y])i--;//向右走while (j < BLOCKSIZE - 1 && mBlocks[x][j + 1] == mBlocks[x][y])j++; if (j - i >= 2){cout<<" ["<<x<<","<<i<<"]-->["<<x<<","<<j<<"] Cleared!"<<endl;ok = true;} return ok;}bool checkDeathLock(){ //循环遍历查找 for (int i = 0; i < BLOCKSIZE - 1; i++) for (int j = 0; j < BLOCKSIZE - 1; j++) { //向右交换查找 swap(mBlocks[i][j], mBlocks[i + 1][j]); if (isOK(i, j) || isOK(i+1, j)) { cout<<">>#Find# Down:["<<i<<","<<j<<"]->"<<"["<<i + 1<<","<<j<<"]"<<endl;cout<<"--------------------------"<<endl;cout<<"Clear : "<<endl;isOK(i,j);isOK(i + 1, j); return true; } else //未查找到可消去的，则将交换的交换回来 swap(mBlocks[i][j], mBlocks[i + 1][j]); //向下交换查找 swap(mBlocks[i][j], mBlocks[i][j + 1]); if (isOK(i, j) || isOK(i, j+1)) { cout<<">>#Find# Right:["<<i<<","<<j<<"]->"<<"["<<i<<","<<j + 1<<"]"<<endl;cout<<"--------------------------"<<endl;cout<<"Clear : "<<endl;isOK(i,j);isOK(i, j + 1); return true; } else //未查找到可消去的，则将交换的交换回来 swap(mBlocks[i][j], mBlocks[i][j + 1]); } cout<<">>No Path!"<<endl; return false;}int main(){ randomMap(); for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) if (mBlocks[i][j] >= 10) cout<<mBlocks[i][j]<<" "; else cout<<"0"<<mBlocks[i][j]<<" "; cout<<endl; } cout<<endl; checkDeathLock(); return 0;}