八码问题c++源程序

ffffff> class CNineGird { public: struct PlaceList { DWORD Place; PlaceList* Left; PlaceList* Right; }; struct Scanbuf { DWORD Place; int ScanID; }; struct PathList { unsigned char Path[9]; }; private: PlaceList *m_pPlaceList; Scanbuf *m_pScanbuf; RECT m_rResetButton; RECT m_rAutoButton; public: int m_iPathsize; clock_t m_iTime; UINT m_iStepCount; unsigned char m_iTargetChess[9]; unsigned char m_iChess[9]; HWND m_hClientWin; PathList *m_pPathList; bool m_bAutoRun; private: inline bool AddTree(DWORD place , PlaceList*& parent); void FreeTree(PlaceList*& parent); inline void ArrayToDword(unsigned char *array , DWORD & data); inline void DwordToArray(DWORD data , unsigned char *array); inline bool MoveChess(unsigned char *array , int way); bool EstimateUncoil(unsigned char *array); void GetPath(UINT depth); public: void MoveChess(int way); bool ComputeFeel(); void ActiveShaw(HWND hView); void DrawGird(HDC hDC , RECT clientrect); void DrawChess(HDC hDC , RECT clientrect); void Reset(); void OnButton(POINT pnt , HWND hView); public: CNineGird(); ~CNineGird(); }; 　　计算随机随机数组使用了vector模板用random_shuffle（，）函数来打乱数组数据，并计算目标结果是什么。代码： void CNineGird::Reset() { if(m_bAutoRun) return; vector vs; int i; for (i = 1 ; i < 9 ; i ++) vs.push_back(i); vs.push_back(0); random_shuffle(vs.begin(), vs.end()); random_shuffle(vs.begin(), vs.end()); for ( i = 0 ; i < 9 ; i ++) { m_iChess[i] = vs[i]; } if (!EstimateUncoil(m_iChess)) { unsigned char array[9] = {1,2,3,8,0,4,7,6,5}; memcpy(m_iTargetChess , array , 9); } else { unsigned char array[9] = {1,2,3,4,5,6,7,8,0}; memcpy(m_iTargetChess , array , 9); } m_iStepCount = 0; } 数据压缩函数实现： inline void CNineGird::ArrayToDword(unsigned char *array , DWORD& data) { unsigned char night = 0; for ( int i = 0 ; i < 9 ; i ++) { if (array[i] == 8) { night = (unsigned char)i; break; } } array[night] = 0; data = 0; data = (DWORD)((DWORD)array[0] << 29 | (DWORD)array[1] << 26 | (DWORD)array[2] << 23 | (DWORD)array[3] << 20 | (DWORD)array[4] << 17 | (DWORD)array[5] << 14 | (DWORD)array[6] << 11 | (DWORD)array[7] << 8 | (DWORD)array[8] << 5 | night); array[night] = 8; } 解压缩时跟压缩真好相反，解压代码： inline void CNineGird::DwordToArray(DWORD data , unsigned char *array) { unsigned char chtem; for ( int i = 0 ; i < 9 ; i ++) { chtem = (unsigned char)(data >> (32 - (i + 1) * 3) & 0x00000007); array[i] = chtem; } chtem = (unsigned char)(data & 0x0000001F); array[chtem] = 8; } 　　由于可扩展的数据量非常的大，加上我在保存的时候使用的是ＤＷＯＲＤ类型，将每一步数据都记录在一个排序二叉树中，按从小到大从左到有的排列，搜索的时候跟每次搜索将近万次的形式比较快几乎是Ｎ次方倍，把几个在循环中用到的函数声明为内联函数，并在插入的时候同时搜索插入的数据会不会在树中有重复来加快总体速度。二叉树插入代码： inline bool CNineGird::AddTree(DWORD place , PlaceList*& parent) { if (parent == NULL) { parent = new PlaceList(); parent->Left = parent->Right = NULL; parent->Place = place; return true; } if (parent->Place == place) return false; if (parent->Place > place) { return AddTree(place , parent->Right); } return AddTree(place , parent->Left); } //计算结果是奇数排列还是偶数排列的代码： bool CNineGird::EstimateUncoil(unsigned char *array) { int sun = 0; for ( int i = 0 ; i < 8 ; i ++) { for ( int j = 0 ; j < 9 ; j ++) { if (array[j] != 0) { if (array[j] == i +1 ) break; if (array[j] < i + 1) sun++; } } } if (sun % 2 == 0) return true; else return false; } 　　 　　//在进行广度搜索时候，将父结点所在的数组索引记录在子结点中了，所以得到目标排列的时候，我们只要从子结点逆向搜索就可以得到最优搜索路径了。用变量m_iPathsize来记录总步数，具体函数代码： void CNineGird::GetPath(UINT depth) { int now = 0 , maxpos = 100 ; UINT parentid; if (m_pPathList != NULL) { delete[] m_pPathList; } m_pPathList = new PathList[maxpos]; parentid = m_pScanbuf[depth].ScanID; DwordToArray(m_pScanbuf[depth].Place , m_pPathList[++now].Path); while(parentid != -1) { if (now == maxpos) { maxpos += 10; PathList * temlist = new PathList[maxpos]; memcpy(temlist , m_pPathList , sizeof(PathList) * (maxpos - 10)); delete[] m_pPathList; m_pPathList = temlist; } DwordToArray(m_pScanbuf[parentid].Place , m_pPathList[++now].Path); parentid = m_pScanbuf[parentid].ScanID; } m_iPathsize = now; } 　　 //首先得到源数组，将其转换成ＤＷＯＲＤ型，与目标比较，如果相同完成，不同就交换一下数据和空格位置，加入二叉树，搜索下一个结果，直到没有步可走了，在搜索刚刚搜索到的位置的子位置，这样直到找到目标结果为止，函数： bool CNineGird::ComputeFeel() { unsigned char *array = m_iChess; UINT i; const int MAXSIZE = 362880; unsigned char temparray[9]; DWORD target , fountain , parent , parentID = 0 , child = 1; ArrayToDword(m_iTargetChess , target); ArrayToDword(array , fountain); if (fountain == target) { return false; } if (m_pScanbuf != NULL) { delete[] m_pScanbuf; } m_pScanbuf = new Scanbuf[MAXSIZE]; AddTree(fountain ,m_pPlaceList); m_pScanbuf[ 0 ].Place = fountain; m_pScanbuf[ 0 ].ScanID = -1; clock_t tim = clock(); while(parentID < MAXSIZE && child < MAXSIZE) { parent = m_pScanbuf[parentID].Place; for ( i = 0 ; i < 4 ; i ++)　// 0 :UP , 1:Down ,2:Left,3:Right { DwordToArray(parent , temparray); if (MoveChess(temparray,i)) //是否移动成功 { ArrayToDword(temparray , fountain); if (AddTree(fountain, m_pPlaceList)) //加入搜索数 { m_pScanbuf[ child ].Place = fountain; m_pScanbuf[ child ].ScanID = parentID; if (fountain == target) //是否找到结果 { m_iTime = clock() - tim; GetPath(child);//计算路径 FreeTree(m_pPlaceList); delete[] m_pScanbuf; m_pScanbuf = NULL; return true; } child ++; } } } // for i parentID++; } m_iTime = clock() - tim; FreeTree(m_pPlaceList); delete[] m_pScanbuf; m_pScanbuf = NULL; return false; }