Question 1
Printed graph sheets were provided on time.
Printed graph sheets were provided late.
Printed graph sheets were not provided.
I used the graph sheets.
I did not use graph sheets.
Printed graph sheets were provided on time.
Printed graph sheets were provided late.
Printed graph sheets were not provided.
I used the graph sheets.
I did not use graph sheets.
SEARCH
The figure shows a map on a uniform grid where each tile is 10x10 in size.
The start node is S and the goal node is G.
The MoveGen function returns nodes in alphabetical order.
Use Manhattan Distance as the heuristic function.
Tie-breaker: If several nodes have the same cost, use node labels to break the tie.
Based on the above data, answer the given subquestions.
What is the path found by the Best First Search algorithm? Enter the path as a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: S,X,Y,Z
SEARCH
The figure shows a map on a uniform grid where each tile is 10x10 in size.
The start node is S and the goal node is G.
The MoveGen function returns nodes in alphabetical order.
Use Manhattan Distance as the heuristic function.
Tie-breaker: If several nodes have the same cost, use node labels to break the tie.
Based on the above data, answer the given subquestions.
What is the path found by A* search algorithm? Enter the path as a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS 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) End Term paper sat on 13 Apr 2025, in the January 2025 term: 26 questions for 25 marks in 180 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 End Term 13 Apr 2025 at a glance |
|---|---|
| Term | January 2025 term |
| Subject | AI: Search Methods for Problem Solving |
| Course code | BSCS3003 |
| Questions | 26 |
| Marks | 25 |
| Duration | 180 min |
| MSQ | 7 |
| Written | 13 |
| MCQ | 4 |
| Numerical | 2 |
| Official paper | IIT M IMPROVEMENT AN EXAM QIM3 13 Apr 2025 |
| Negative marking | No negative marking. |
| Updated |