1、 struct Node * next; struct Node *previous;/保存其父节点 ;int open_N=0; /记录Open列表中节点数目/八数码初始状态int inital_s33= 2,8,3,1,6,4,7,0,5;/八数码目标状态int final_s33= 2,1,6,4,0,8,7,5,3/-/添加节点函数入口,方法:通过插入排序向指定表添加void Add_Node( struct Node *head, struct Node *p) struct Node *q; if(head-next)/考虑链表为空 q = head-next; if(p-f ne
2、xt-f)/考虑插入的节点值比链表的第一个节点值小 p-next = head- head-next = p; else while(q-next)/考虑插入节点x,形如a= x p-f |q-f = p-f) & (q-f f | q-f)next = q- q- break; q = q- if(q-next = NULL) /考虑插入的节点值比链表最后一个元素的值更大 q- else head-/删除节点函数入口void del_Node(struct Node * head, struct Node *p ) q = head; while(q-next) next = p) q-ne
3、xt = p-next = NULL;next = NULL) return; / free(p); q = q-/判断两个数组是否相等函数入口int equal(int s133, int s233) int i,j,flag=0; for(i=0; i 3 ; i+) for(j=0; j int flag = 0; while(q) if(equal(q-s,s) flag=1; Old_Node-next = q; return 1; else q = q-flag) return 0;/计算p(n)的函数入口/其中p(n)为放错位的数码与其正确的位置之间距离之和/具体方法:放错位的数
4、码与其正确的位置对应下标差的绝对值之和int wrong_sum(int s33) int i,j,fi,fj,sum=0; for(i=0 ;3; j+) for(fi=0; fi fi+) for(fj=0; fjsij = BESTNODE-sij;/获取空格所在位置 if(BESTNODE-sij = 0)i_0 = i; j_0 = j;break; switch(direction) case 0: if(i_0-1)-1 ) temp = Successor-si_0j_0; Successor-si_0j_0 = Successor-si_0-1j_0;si_0-1j_0 =
5、temp; return 1; else return 0; case 1: if(j_0-1)-1)si_0j_0-1;si_0j_0-1 = temp; case 2: if( (j_0+1)3)si_0j_0+1;si_0j_0+1 = temp; case 3: if(i_0+1)/输出最佳路径函数入口void print_Path(struct Node * head) struct Node *q, *q1,*p; int i,j,count=1; p = (struct Node *)malloc(sizeof(struct Node); /通过头插法变更节点输出次序previo
6、us = NULL; q1 = q-previous;previous = p-previous = q; q = q1; q = p- if(q = p-previous)printf(八数码的初始状态:n); else if(q-previous = NULL)printf(八数码的目标状态: else printf(八数码的中间态%dn,count+); printf(%4d,q-sij); if(j = 2)printf( printf(f=%d, g=%dnnf,q-g);/A*子算法入口:处理后继结点void sub_A_algorithm(struct Node * Open,
7、struct Node * BESTNODE, struct Node * Closed,struct Node *Successor) struct Node * Old_Node = (struct Node *)malloc(sizeof(struct Node); Successor-previous = BESTNODE;/建立从successor返回BESTNODE的指针g = BESTNODE-g + 1;/计算后继结点的g值/检查后继结点是否已存在于Open和Closed表中,如果存在:该节点记为old_Node,比较后继结点的g值和表中old_Node节点/g值,前者小代表新
8、的路径比老路径更好,将Old_Node的父节点改为BESTNODE,并修改其f,g值,后者小则什么也不做。/即不存在Open也不存在Closed表则将其加入OPen表,并计算其f值 if( exit_Node(Open, Successor-s, Old_Node) ) if(Successor-g g)/将Old_Node的父节点改为BESTNODEg = Successor-g;/修改g值f = Old_Node-g + wrong_sum(Old_Node-s);/修改f值 /排序 del_Node(Open, Old_Node); Add_Node(Open, Old_Node); e
9、lse if( exit_Node(Closed, Successor-s, Old_Node) del_Node(Closed, Old_Node); Add_Node(Closed, Old_Node); else f = Successor-g + wrong_sum(Successor- Add_Node(Open, Successor); open_N+;/A*算法入口/八数码问题的启发函数为:f(n)=d(n)+p(n)/其中A*算法中的g(n)根据具体情况设计为d(n),意为n节点的深度,而h(n)设计为p(n),/意为放错的数码与正确的位置距离之和void A_algorith
10、m(struct Node * Open, struct Node * Closed) /A*算法 int i,j; struct Node * BESTNODE, *inital, * Successor; inital = (struct Node * )malloc(sizeof(struct Node); /初始化起始节点 inital-sij = inital_sij; inital-f = wrong_sum(inital_s);g = 0; Add_Node(Open, inital);/把初始节点放入OPEN表 open_N+; while(1) if(open_N = 0)p
11、rintf(failure! return; BESTNODE = get_BESTNODE(Open);/从OPEN表获取f值最小的BESTNODE,将其从OPEN表删除并加入CLOSED表中 del_Node(Open, BESTNODE); open_N-; Add_Node(Closed, BESTNODE); if(equal(BESTNODE-s, final_s) /判断BESTNODE是否为目标节点 printf(success! print_Path(BESTNODE); return; /针对八数码问题,后继结点Successor的扩展方法:空格(二维数组中的0)上下左右移
12、动, /判断每种移动的有效性,有效则转向A*子算法处理后继节点,否则进行下一种移动 else Successor = (struct Node * )malloc(sizeof(struct Node); if(get_successor(BESTNODE, 0, Successor)sub_A_algorithm( Open, BESTNODE, Closed, Successor); if(get_successor(BESTNODE, 1, Successor)sub_A_algorithm( Open, BESTNODE, Closed, Successor); if(get_succ
13、essor(BESTNODE, 2, Successor)sub_A_algorithm( Open, BESTNODE, Closed, Successor); if(get_successor(BESTNODE, 3, Successor)sub_A_algorithm( Open, BESTNODE, Closed, Successor);/main()函数入口/定义Open和Closed列表。Open列表:保存待检查节点。Closed列表:保存不需要再检查的节点void main() struct Node * Open = (struct Node * )malloc(sizeof(struct Node); struct Node * Closed = (struct Node * )malloc(sizeof(struct Node); Open-next = NULL ; Closed-next =NULL; A_algorithm(Open, Closed);
copyright@ 2008-2022 冰豆网网站版权所有
经营许可证编号:鄂ICP备2022015515号-1