人工智能导论八数码算法源程序代码.docVIP

#includestdio.h #includestdlib.h #includemath.h //八数码状态对应的节点结构体 struct Node{ int s[3][3];//保存八数码状态，0代表空格 int f,g;//启发函数中的f和g值 struct Node * next; struct Node *previous;//保存其父节点 }; int open_N=0; //记录Open列表中节点数目 //八数码初始状态 int inital_s[3][3]={ 2,1,3, 8,5,4, 7,0,6 }; //八数码目标状态 int final_s[3][3]={ 1,2,3, 8,0,4, 7,6,5 }; //------------------------------------------------------------------------ //添加节点函数入口，方法：通过插入排序向指定表添加 //------------------------------------------------------------------------ void Add_Node( struct Node *head, struct Node *p) { struct Node *q; if(head-next)//考虑链表为空 { q = head-next; if(p-f head-next-f){//考虑插入的节点值比链表的第一个节点值小 p-next = head-next; head-next = p; } else { while(q-next)//考虑插入节点x，形如a= x =b { if((q-f p-f ||q-f == p-f) (q-next-f p-f || q-next-f == p-f)){ p-next = q-next; q-next = p; break; } q = q-next; } if(q-next == NULL) //考虑插入的节点值比链表最后一个元素的值更大 q-next = p; } } else head-next = p; } //------------------------------------------------------------------------ //删除节点函数入口 //------------------------------------------------------------------------ void del_Node(struct Node * head, struct Node *p ) { struct Node *q; q = head; while(q-next) { if(q-next == p){ q-next = p-next; p-next = NULL; if(q-next == NULL) return; // free(p); } q = q-next; } } //------------------------------------------------------------------------ //判断两个数组是否相等函数入口 //------------------------------------------------------------------------ int equal(int s1[3][3], int s2[3][3]) { int i,j,flag=0; for(i=0; i 3 ; i++) for(j=0; j 3 ;j++) if(s1[i][j] != s2[i][j]){flag = 1; break;} if(!flag) return 1; else return 0; } //------------------------------------------------------------------------ //判断后继节点是否存在于Open或Closed表中函数入口 //------------------------------------------------------------------------ int exit_Node(struct Node * head,int s[3][3], struct Node *Old_Node