Artificial Intelligence - Approaches to Artificial Intelligence

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

Figure 3.2 depicts a search space in which the nodes are labeled with uppercase alphabets: A,B,C,… . Here, node I is the start node and node X is the goal node. The nodes are laid out on a grid where each square is of size 10 x 10 units.
Pleae use the Manhattan Distance as the heuristic function for the following problems.

For the questions below please enter the answer as a sequence of nodes separated by a comma.

31. Given the goal node X in Figure 3.2 label each node with its heuristic value. Use the Manhattan Distance as the heuristic function. What is the value returned by the heuristic function for the nodes A, I and X respectively?

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 *


Figure 3.2 depicts a search space in which the nodes are labeled with uppercase alphabets: A,B,C,… . Here, node I is the start node and node X is the goal node. The nodes are laid out on a grid where each square is of size 10 x 10 units.
Pleae use the Manhattan Distance as the heuristic function for the following problems.

For the questions below please enter the answer as a sequence of nodes separated by a comma.

32. Starting at node I, list the order in which the Hill Climbing algorithm explores the graph till termination, use Manhattan Distance as the heuristic function.

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 *


33. List the order in which the Best First Search algorithm explores the graph till termination. Use Manhattan distance as the heuristic function.

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 *


34. What is the path found (if any) by the algorithm in the previous question?

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 *


35. If a game tree is seen as an AND/OR tree, identify the true statements
1. An AND node corresponds to a node where MIN has to play
2. An AND node corresponds to a node where MAX has to play
3. An OR node corresponds to a node where MIN has to play
4. An OR node corresponds to a node where MAX has to play

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 *