(人工智能课件）AIChapter03StructuresandStretegiesforStateSpaceSearch.ppt

3.2.2 Implementing Graph Search The main idea of procedure backtrack Backtrack is a recursive procedure, S is its argument, S is the current state of the search graph, if S is a goal state, the procedure terminates and return the solution path, else generate the child node of S, Schild, and use the procedure to Schild, recursively, If none of the children of S lead to a goal, then backtrack is applied to the siblings of S, and so on. Tree lists used in backtrack SL, for state list, lists the states in the current path being tried. If a goal is found, SL contains the ordered list of states on the solution path. NSL, for new state list, contains nodes awaiting evaluation, i.e. nodes whose descendants have not yet been generated and searched. DE, for dead end, lists states whose descendants have failed to contain a goal node. If these states are encountered again, they will be detected as elements of DE and eliminated from consideration immediately funtion backtrack begin SL:=[Start]; NSL:=[Start]; DE:=[ ]; CS:=start; while NSL π [ ] do begin if CS=goal then return SL if CS has no children(exclude nodes already on DE, SL, and NSL) then begin while SL is not empty and CS=the first element of SL do add CS to DE remove first element from SL; remove first element from NSL; CS:= first element from NSL; end add CS to SL; end else begin place children of CS children(exept nodes already on DE, SL, and NSL) on NSL; CS:= first element from NSL; add CS to SL end end; return FAIL; end J F E D C B A I H G 10 8 3 2 1