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.
Question 2
SEARCH The figure shows a map on a uniform grid where each tile is 1x1 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,G Answers Case Sensitive : No
Question 3
SEARCH The figure shows a map on a uniform grid where each tile is 1x1 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.
Answers Case Sensitive : No
31 more questions in this paper
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.
More on the AI Search Methods End Term 21 Dec 2025 paper
The IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 21 Dec 2025, in the September 2025 term: 34 questions for 34 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 21 Dec 2025 at a glance |
|---|---|
| Term | September 2025 term |
| Subject | AI: Search Methods for Problem Solving |
| Course code | BSCS3003 |
| Questions | 34 |
| Marks | 34 |
| Duration | 180 min |
| MSQ | 5 |
| Written | 17 |
| MCQ | 12 |
| Official paper | Ai: Search Methods For Problem Solving 18 Dec 25 |
| Negative marking | No negative marking. |
| Updated |