贪心算法求解马踏棋盘.doc

#include stdio.h #define X 8 #define Y 8 #define N 8 struct child { int x; int y; int wayout;//子节点访问次数 }node[N]; int chess[X][Y]; int addx[N]={-2,-1,1,2,2,1,-1,-2}; int addy[N]={1,2,2,1,-1,-2,-2,-1}; int way(int x,int y,int m,int n)//计算子节点出口多少 { int i; int tx; int ty; int count=-1; for(i=0;iN;i++) { tx=x+addx[i]; ty=y+addy[i]; if((x=0)(y=0)(xX)(yY)(tx=0)(ty=0)(txX)(tyY)(chess[tx][ty]==0)(chess[x][y]==0)((tx!=m)||(ty!=n)))//进行子节点出口的判定 { count++; } } return count; } int finalway(int x,int y)//完成最后节点的确定 { chess[x][y]=X*Y-1; int tx; int ty; int i; for(i=0;iN;i++) { tx=x+addx[i]; ty=y+addy[i]; if((x=0)(y=0)(xX)(yY)(tx=0)(ty=0)(txX)(tyY)(chess[tx][ty]==0)((tx!=x)||(ty!=y)))//进行最后节点出口的判定 { chess[tx][ty]=X*Y; return 1; } } return 0; } void sort(child *point) { int i,j; struct child swap; for(i=0;iN;i++)//采用冒泡排序 { for(j=0;jN-1;j++) { if(point[j].wayoutpoint[j+1].wayout) { swap=point[j]; point[j]=point[j+1]; point[j+1]=swap; } } } /*for(i=0;iN;++i) { for(t=i,j=i+1;jN;++j) if(point[j].wayoutpoint[t].wayout) t=j; if(ti) { swap=point[i]; point[i]=point[t]; point[t]=swap; } }*/ } int TravelChessBoard(int x,int y,int tag) { int xx=x; int yy=y; int i; /*if(tagX*Y) { //chess[xx][yy]=tag; printf(The horse has travelled the chess borad\n); return 1; }*/ if(tag!=X*Y) { for(i=0;iN;i++) { node[i].x=xx+addx[i]; node[i].y=yy+addy[i]; node[i].wayout=way(node[i].x,node[i].y,xx,yy); } sort(node); for(i=0;(node[i].wayout0)(i=N);i++);//去掉访问过的节点和没有出口的节点 if(i==N)return 0; for(;iN;i++) { xx=node[i].x; yy=node[i].y; chess[xx][yy]=tag; if(TravelChessBoard(xx,yy,tag+1)==1) return 1; else chess[xx][yy]=0; } } else { if(finalway(xx,yy))return 1; else { return 0; } } return 0; } int main() { int i,