八数码问题实验报告

八数码问题实验报告一、实验目的二、实验内容九宫格中有8个数码，其中只有一个空，规则是只能把一个数码移动到空的格子中，要求从一个初始状态移动到一个目标状态所要花费的最少步数【算法分析】【具体步骤】四、代码和结果^defineCRTSECURENOWARNINGS#include"stdlib.h"#include，zstdio.h〃typedefstructNode{intnum[9];〃棋盘状态intdeepth;〃派生的深度g(n)intdiffnum;〃不在位的数目h(n)intvalue;//耗散值f(n)=g(n)+h(n)structNode*pre;structNode*next;p2->parent=pl;p2->deepth=pl->deepth+1;p2->diffnum=diff(p2->num);p2->value=p2->deepth+p2->diffnum;if(p2->diffnum二二0)(total_step=printresult(p2);printfC一共需要：步\n〃，totalstep);free_list(open);free_list(close);return1;)else(numNodenum++;open_insert(open,p2);})elsefree(p2);return0;}intoperate(intm[],intop)(intblank;blank=0;while(m[blank]!=0&&blank<9)++blank;if(blank==9)return1;switch(op){/*up*/if(blank>2)swap(m+blank,m+blank-3);break;/*down*/if(blank<6)swap(m+blank,m+blank+3);

break;/*left*/if(blank!=0&&blank!=3&&blank!=6)swap(m+blank,m+blank-1);break;/*right*/if(blank!=2&&blank!=5&&blank!=8)swap(m+blank,m+blank+1);break;default:return1;)return0;}voidswap(int*a,int*b)(intc;c二*a;*a二*b;*b二c;}numNode*copy_numNode(numNode*chu_shi_zhuang_tai){numNode*p;p=createnumNode(;p->deepth=chu_shi_zhuang_tai->deepth;p->diffnum=chu_shi_zhuang_tai->diffnum;p->value=chu_shi_zhuang_tai->value;inti;for(i=0;i<9;i++)((p->num)[i]=(chu_shi_zhuang_tai->num)[i];)returnp;)intdiff(intnum[9])(inti,diffnum=0;for(i=0;i<9;i++)if(num[i]!=mu_biao_zhuang_tai[i])diffnum++;returndiffnum;}charisNewNode(numNode*open,numNode*close,intnum[91)numNode*p;inti=0;p=open->next;while(p!=NULL)(for(i=0;i<9;i++)(if(p->num[i]!=num[i])break;)if(i=9)return'O';//Openp=p->next;)p二close->next;while(p!=NULL)for(i=0;i<9;i++)if(p->num[i]!=num[i])break;)if(i==9)return'C';//Closep=p->next;)return'N';}voidfree_list(numNode*head){numNode*p,*q;p=head->next;while(p!=NULL){q=p->next;free(p);free(head);voidprint_num(intnum[9])(inti;for(i=0;i<9;i++)(printfnum[i]);if((i%3)=二2)printf(〃\n〃)；)}intprintresult(numNode*item)(numNode*p;intstep;p=item;if(p!=NULL)step=print_result(p->parent);printf("\n第%d步：\n〃，step+1);printnum(p->num);returnstep+1;)else(return-1;}ostructNode*parent;}numNode;〃棋盘初始状态intchushizhuangtai[9];〃棋盘目标状态intmu_biao_zhuang_tai[9];intnumNodenum,total_step;numNode*open,*close;numNode*create_numNode((return(numNode*)malloc(sizeof(numNode));)〃返回第一项，并从Open表中删除numNode*opengetfirst(numNode*head);〃向Open表中按序插入新节点voidopen_insert(numNode*head,numNode*item);〃向Close表中插入新节点voidcloseappend(numNode*head,numNode*item);intexpand(numNode*item);〃扩展节点intprint_result(numNode*item);//打印结果numNode*copy_numNode(numNode*orgin);〃是否在Open表或Close表中charisNewNode(numNode*open,numNode*close,intnum[9]);voidprint_num(intnum[9]);〃打印棋盘状态intdiff(intnum[9]);//求不在位棋子的个数〃初始化，获得棋盘初始状态和目标状态voidinit(;voidswap(int*a,int*b);intoperate(intnum[],intop);voidfreelist(numNode*head);voidopen_insert(numNode*head,numNode*item);voidclose_append(numNode*head,numNode*item);intexpand(numNode*pl);〃程序入口intmain(intargc,char*argv[])(〃初始化Open表和Close表open=create_numNode(;close=createnumNode(;〃由用户输入初始和目标状态open->pre=open->next=close->pre=close->next=NULL;init(;〃初始化初始节点numNode*pl;pl二createnumNode(;pl->parent=NULL;pl->deepth=0;inti=0;for(i=0;i<9;i++)(pl->num[i]=chushizhuangtai[i];)open_insert(open,pl);numNodenum=1;pl二opengetfirst(open);while(pl!=NULL)closeappend(close,pl);if(expand(pl))returnEXIT_SUCCESS;pl=opengetfirst(open);)printf(，zNosolution!\n，z);returnEXIT_SUCCESS;}/*主函数部分*/〃子函数voidinit((while(1)Iprintf(〃规定123456780代表状态\n〃〃123\n〃〃456\n〃"780\n〃);printf(〃请输入初始状态(数字之间无空格)\n〃);chartemp[10];scanf(〃%s〃，&temp);inti=0;for(i=0;i<9&&temp[i]-'O'>=0&&temp[i]-O'<=8;i++){chu_shi_zhuang_tai[i]=temp[i]-'O';)printf(〃\n〃)；printf(〃请输入目标状态(格式同上)：\n〃)；scanf(〃%s〃，fetemp);intj=0;for(j=0;j<9&&temp[j]一'O'>=0&&temp[j]-0，<=8;j++)(mu_biao_zhuang_tai[j]=temptj]-'O';)printf(〃\n〃)；system(〃cls〃)；if(i==9&&j==9)break;)}voidopen_insert(numNode*head,numNode*item)(numNode*p,*q;p=head->next;q=head;while(p!=NULL&&item->value>p->value){q二P；p=p->next;)q->next=item;item->pre=q;item->next=p;if(p!=NULL)p->pre=item;numNode*open_getfirst(numNodc*head)(numNode*p;if(head->next==NULL)(returnNULL;)p=head->next;head->next=p->next;if(p->next!=NULL)Ip->next->pre=head;)p->pre=NULL;p->next=NULL;returnp;voidcloseappend(numNode*head,numNode*item){item->next=head->ne