Approaches to AI 21

0. The CLOSED list used by a search algorithm contains node-pairs as a list of two nodes (child, parent). Starting from the start node S represented by the list (S, nil), the algorithm fins the goal node G in the node-pair (G, Q). The algorithm then calls ReconstructPath before termination. If the CLOSED list is as given below:
CLOED = ((R,M), (Q,L), (P,K), (T,O), (O,J), (N,J), (K,F), (L,H), (M,H), (J,D), (I,D), (E,B), (F,C), (H,C), (A,), (D,B), (B,S), (C,S)).
What is the path found by the search algorithm?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *