Vertex S denotes the start state and vertices G1 and G2 denote the two goal states. Directed edges are labelled with the actual costs of traversing the edge. In what order would Iterative deepening Depth-First Search visit the states when starting the search in S? Consider the sequence of states as they are encountered for the first time on each path in each iteration of the algorithms. Remember that the Depth-First Search utilised in the iterative algorithm forgets that a state has been visited when backtracking over it. If all else is equal, consider states in alphabetic order. Select one: a. S, A, B, C, E, F, G1 b. S, A, C, E, B, A, F, C, G1 c. S, A, C, E, B, F, G1 d. S, A, C, G1 e. S, S, A, B, C, S, A, C, E, B, A, F, C, G1 f. Iterative Deepening Search enters an infinite loop
Vertex S denotes the start state and vertices G1 and G2 denote the two goal states. Directed edges are labelled with the actual costs of traversing the edge.
In what order would Iterative deepening Depth-First Search visit the states when starting the search in S?
Consider the sequence of states as they are encountered for the first time on each path in each iteration of the algorithms. Remember that the Depth-First Search utilised in the iterative
If all else is equal, consider states in alphabetic order.
S, A, B, C, E, F, G1
S, A, C, E, B, A, F, C, G1
S, A, C, E, B, F, G1
S, A, C, G1
S, S, A, B, C, S, A, C, E, B, A, F, C, G1
Iterative Deepening Search enters an infinite loop
Step by step
Solved in 2 steps with 1 images