人工智能导论实验报告姓名：蔡鹏学号：1130310726实验一一、实验内容有如下序列，试把所有黑色格移到所有白色格的右边,黄色格代表空格，黑色格和白色格可以和距离不超过三的空格交换。二、实验代码#include #define N 10＃define inf 9999int g=999;void tree_gener(struct node *fn，struct node ＊root）;struct node{char seq［7]；int f,g，n；struct node *sn［N］；｝;struct stack{int num;struct node *n［50］；｝；void Enstack（struct node *sn,struct stack ＊S)｛S—〉n[S-〉num］=sn;S-〉num++；}struct node ＊Destack（struct stack *S)｛S-〉num——；return S->n[S->num］;｝void find_min_f（struct node ＊root）{int i;struct node ＊n，＊min；struct stack S;S。num=0；min=root；Enstack（root，&S）;while(S。num！=0）{n=Destack（&S）；if(n-〉f < min-〉f){min=n；}for(i=0;i〈n—〉n；i++）｛Enstack(n->sn[i]，＆S);}｝ tree_gener（min,root）；if（g〉min-〉g）｛ printf(”seq:%c %c %c ％c ％c ％c ％c ｜ g：%d \n"，min->seq［0]，min—〉seq［1］,min—>seq[2］,min-〉seq[3］,min->seq[4]，min—〉seq[5],min—>seq[6］,min—>g）;｝g=min->g;｝void swap（struct node ＊sn，struct node ＊fn，int n,int m）｛int i;for(i=0;i〈7;i++）｛sn—〉seq［i]=fn—>seq[i]；}sn—〉seq［n]=fn—〉seq［m];sn-〉seq[m］=fn->seq[n];}int calcu_h(char seq［］）｛int m=0，n=0,i；for（i=0；i〈7;i++）{if(seq［i］=='B’）{m++；}if(seq[i]=='W’)｛n=n+m；}}return n；}void tree_gener(struct node ＊fn，struct node *root）{if (calcu_h（fn->seq)!=0)｛int i;int j=0，k；for （i=0；i<7;i++）｛if(fn->seq［i］=='＃'）｛for(k=1;k<=3;k++）｛if（i+k<7){fn—>sn[j］=(struct node *)malloc（sizeof(struct node))；swap(fn—〉sn［j]，fn,i,i+k)；fn—>sn［j］->g = fn->g+k；fn—>sn[j］—>f = fn-〉sn［j]—〉g + 3*calcu_h（fn—〉sn[j]->seq);fn-〉sn[j]—>n=0;j++;｝if(i-k〉=0){fn—〉sn[j］=（struct node *）malloc（sizeof（struct node)）；swap（fn—〉sn［j］，fn，i,i—k）;fn—〉sn［j］—〉g = fn->g+k；fn—>sn[j]—>f = fn-〉sn［j]—...
