人工智能的迷宫问题.docx

1. 题目：给出下面的迷宫图，找出走出迷宫的路径。2算符与状态空间迷宫算符：左右上下状态空间：3求解的状态空间图4给出各类表5程序代码traceDOMAINSstate=symbolDATABASE-mydatabaseopen(state,integer) closed(integer,state,integer) res(state) mark(state) fail_PREDICATESsolvesearch(state,state)resultsearchingstep4(integer,state)step56(integer,state)equal(state,state)repeatresulting(integer)rule(state,state)road(state,state)GOALsolve.CLAUSESsolve:-search(s0,sg),result.search(Begin,End):-retractall(_,mydatabase),assert(closed(0,Begin,0),assert(open(Begin,0), assert(mark(End),repeat,searching,!. result:-not(fail_), retract(closed(0,_,0),closed(M,_,_),resulting(M),!. result:-beep,write(sorry dont find a road!).searching:-open(State,Pointer),retract(open(State,Pointer),closed(No,_,_),No2=No+1,asserta(closed(No2,State,Pointer),!,step4(No2,State).searching:-assert(fail_).step4(_,State):-mark(End),equal(State,End).step4(No3,State):-step56(No3,State),!,fail.step56(No4,StateX):-rule(StateX,StateY), not(open(StateY,_), not(closed(_,StateY,_), assertz(open(StateY,No4),fail.step56(_,_):-!. equal(X,X).repeat.repeat:-repeat.resulting(N):-closed(N,X,M),asserta(res(X),resulting(M).resulting(_):-res(X),write(X),nl,fail.resulting(_):-!.rule(X,Y):-road(X,Y).road(s0,s7). road(s7,s8).road(s7,s4). road(s8,s7). road(s8,s9). road(s8,s5).road(s4,s5). road(s4,s1). road(s4,s7). road(s9,s8). road(s9,s6).road(s5,s4). road(s5,s6). road(s5,s2).road(s5,s8). road(s1,s2). road(s1,s4). road(s6,s5).road(s6,sg).road(s6,s3).road(s6,s9).r