Artificial Intelligence - Approaches to Artificial Intelligence

Avatto > > UGC NET COMPUTER SCIENCE > > PRACTICE QUESTIONS > > Artificial Intelligence > > Approaches to Artificial Intelligence

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.

11. What is the path found, if any, by Depth First Search?

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 *


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.

12. For state-space 11, What is the path found, if any, by Breadth First Search?

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 *


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.

13. DFS algorithm runs on state-space 11 and adds only new nodes to OPEN list.
Identify the search tree (showing both open and closed nodes) produced by DFS algorithm when it picks up the goal node.
Here, dashed circles denote open nodes and solid circles denote closed nodes.

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 *


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.

14. Consider the case where, during node expansion, the neighbors returned by MoveGen that are present in OPEN or CLOSED are not opened again.
Now list the first eight nodes visited by DFID on state-space 11, where DFID starts from depth zero.
A node is deemed visited if it passes goal test or is closed.

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 *


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.

15. 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.

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 *