Approaches to AI 14

Home
Approaches to AI 14

ATTENTION: For Q11 thru Q20 all answers must list the nodes in the order visited. A node is deemed visited if it passes goal test or is closed.
A MoveGen function and its equivalent graphical representation is given for a state-space, call it state-space 11.

S is the start state and G is the goal state.
Maintain a CLOSED list to reconstruct the path to a goal.
Nodes returned by MoveGen that are already present in OPEN or CLOSED are not added to OPEN again.

0. BFS algorithm runs on state-space 11 and adds only new nodes to OPEN list
From the trees in the above question, identify the search tree (showing both open and closed nodes) produced by BFS algorithm when it picks up the goal node.

A
Tree-1 is the BFS search tree
B
Tree-2 is the BFS search tree
C
Tree-3 is the BFS search tree
D
Tree-4 is the BFS search tree

Answer
Comment
Array

Option : C
Explanation :

Forgot your password?

I agree with the Terms.

Back to login