void pingtuAstar(int pt[vol][col],int correct[vol][col]){visited.clear();//判断是否是正确状态int correctStateInt = makeInt(correct);if(correctStateInt == makeInt(pt)){cout<< "已是正确状态" <<endl;return;}//初始化头节点openListEle *openList = new openListEle;openList->next = NULL;openList->pre = NULL;//将初始状态加入openlistopenListEle *startEle = new openListEle;startEle->pts.setState(0,0,makeInt(pt));openList->addNext(startEle);openListEle *finalEle = new openListEle;finalEle = NULL;while(true ){if(finalEle != NULL)break;//找到openlist中代价最小的openListEle *minEleP = openList->next;openListEle *minEle = NULL;int minCost = -1;int minElePCount = 0;while(minEleP!=NULL){if(minCost == -1 || minEleP->pts.guessCost<minCost){minCost = minEleP->pts.guessCost;minEle = minEleP;}minElePCount++;minEleP = minEleP->next;}if(minEle == NULL || minEle->pre == NULL)break;//计算以当前状态的可变状态的guessCostint tmpPt[vol][col];int data = minEle->pts.state;for(int i=vol-1;i>=0;--i){for(int j=col-1;j>=0;--j){tmpPt[i][j] = data%10;data = data/10;}}int zi = 0,zj = 0;for(int i=0;i<vol;++i){for(int j=0;j<col;++j)if(tmpPt[i][j] == vol*col-1){zi = i;zj = j;break;}}int offseti[4] = {-1,0,1,0};int offsetj[4] = {0,1,0,-1};for(int i=0;i<4;++i){int ti = zi+offseti[i];int tj = zj+offsetj[i];if(ti<0 || ti>vol-1 || tj<0 || tj>col-1)continue;int t = tmpPt[ti][tj];tmpPt[ti][tj] = tmpPt[zi][zj];tmpPt[zi][zj] = t;int hashcode = makeInt(tmpPt);if(visited.find(hashcode) == visited.end()){visited.insert(hashcode);openListEle *newEle = new openListEle;int tmpguessCost = getGuessCostBetweenTwoState(tmpPt,correct);newEle->pts = ptstate(minEle->pts.currentCost+1,minEle->pts.currentCost+1+tmpguessCost,hashcode);minEle->addNext(newEle);if(hashcode == correctStateInt)finalEle = newEle;}t = tmpPt[ti][tj];tmpPt[ti][tj] = tmpPt[zi][zj];tmpPt[zi][zj] = t;}//从openList中删除deleteOpenListEle(openList,minEle);}                //保存路径stack<openListEle*> rightpath;openListEle *pathEle = finalEle;while(pathEle != NULL){rightpath.push(pathEle);                    pathEle = pathEle->pre;}int steps = 0;//输出路径while(!rightpath.empty()){pathEle = rightpath.top();printPingTu(pathEle->pts.state);getchar();steps++;rightpath.pop();                    }cout<< "共需:"<<steps<<"步" <<endl;
}

set<int> visited;
long long makeInt(int a[vol][col]){   long long sum = 0;for(int i=0;i<vol;++i)for(int j=0;j<col;++j){sum = 10*sum+a[i][j];                                          }return sum;
}int getGuessCostBetweenTwoState(int a[vol][col],int b[vol][col]){int guessCost = 0;for(int ai=0;ai<vol;++ai)for(int aj=0;aj<col;++aj){bool found = false ;for(int bi=0;bi<vol && found == false;++bi)for(int bj=0;bj<col && found == false;++bj)if(a[ai][aj] == b[bi][bj]){guessCost += sqrt(1.0*(ai-bi)*(ai-bi)+(aj-bj)*(aj-bj));found = true;}}return guessCost;
}

运行截图如下：