Question 1
STATE SPACE
STATE SPACE
Based on the above data, answer the given subquestions.
Starting from board G, the sequence of moves 2D,1R,8U,7U will result in __________ .
Board G
Board A
Board B
Board C
Board D
STATE SPACE
STATE SPACE
Based on the above data, answer the given subquestions.
Starting from board G, the sequence of moves 2D,1R,8U,7U will result in __________ .
Board G
Board A
Board B
Board C
Board D
STATE SPACE
STATE SPACE
Based on the above data, answer the given subquestions.
Starting from board S, what is the shortest sequence of moves that will result in board G?
SEARCH
The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid points and are connected by either two-way edges (shown as undirected edges) or one-way edges (shown with one arrowhead).
Take S as the start node and G as the goal node. The MoveGen function returns neighbours in alphabetical order. The RemoveSeen procedure removes neighbours already present in OPEN/CLOSED lists.
Use Manhattan distance when needed.
SEARCH
The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid points and are connected by either two-way edges (shown as undirected edges) or one-way edges (shown with one arrowhead).
Take S as the start node and G as the goal node. The MoveGen function returns neighbours in alphabetical order. The RemoveSeen procedure removes neighbours already present in OPEN/CLOSED lists.
Use Manhattan distance when needed.
When we say a node is inspected/expanded/refined it means: the node is picked up from OPEN, and goal test is called, if goal test fails then MoveGen is called and, depending on the algorithm, the neighbours are selectively placed in OPEN.
Based on the above data, answer the given subquestions.
List the first 4 nodes inspected by Depth First Search. List the nodes in the order they were inspected. If the algorithm terminates early then list the nodes inspected up until termination.
Enter a comma separated list of node labels. NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS. Answer Format: S,X,Y,Z
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
The IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 1 paper sat on 16 Oct 2022, in the September 2022 term, set QPF1: 20 questions for 25 marks in 120 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | AI Search Methods Quiz 1 16 Oct 2022 Set QPF1 at a glance |
|---|---|
| Term | September 2022 term |
| Subject | AI: Search Methods for Problem Solving |
| Course code | BSCS3003 |
| Questions | 20 |
| Marks | 25 |
| Duration | 120 min |
| MCQ | 2 |
| Written | 12 |
| MSQ | 4 |
| Numerical | 2 |
| Official paper | 2022 Oct: IIT M QUIZ 1 DEGREE QPG3 |
| Negative marking | No negative marking. |
| Updated |