Quiz Space

AI: Search Methods for Problem Solving · Quiz 1 · 19 Jul 2026 · May 2026 term

Question 8: SEARCH\ Figure shows a gameboard with 12 positions (tiles…

Question 8

+1 markWritten answer

SEARCH
Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid knight move choices in alphabetical order, e.g., MoveGen(A) = [E,L]. Valid knight move choices are as described in the STATE SPACE SEARCH section.

Each position is a regular hexagon with unit sides, where opposite vertices are 2 units apart and opposite sides are sqrt(3) units apart.
Take the distance between two positions as the Euclidean Distance between the center points of corresponding hexagons. For example, d(A,A) = 0, d(A,B) = 3, d(A,F) = sqrt(3).
There is a knight in position F and no other pieces on the board.
Take F as the start position and C as the goal position.
Use the Euclidean Distance as the heuristic function.
Use alphabetical order to break ties. Note: When we say a node (a state) is inspected/expanded/refined it means: the node (the state) 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.
Note: RemoveSeen procedure will drop neighbours already present in OPEN or CLOSED list.
Based on the above data, answer the given subquestions.

What is the path found by Depth-First Search?
Enter the path as a comma separated list of positions. Enter NIL if a path to the goal is not found. NO SPACES, TABS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS. Answer Format: X,Y,Z Answers Case Sensitive : No

Show answer

Correct answer: F,E,A,L,H,G,C

See the whole paperTake it as a mock test

Question 8 of 25 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 1 paper sat on 19 Jul 2026, in the May 2026 term (Ai: Search Methods For Problem Solving 16 Jul 26). It carries 1 mark.

More questions from this paper

  1. Q1STATE SPACE SEARCH\ A gameboard is made of hexagonal tiles, allowing 6 directions of movement from each tile:\ north, s…
  2. Q2STATE SPACE SEARCH\ A gameboard is made of hexagonal tiles, allowing 6 directions of movement from each tile:\ north, s…
  3. Q3STATE SPACE SEARCH\ A gameboard is made of hexagonal tiles, allowing 6 directions of movement from each tile:\ north, s…
  4. Q4STATE SPACE SEARCH\ A gameboard is made of hexagonal tiles, allowing 6 directions of movement from each tile:\ north, s…
  5. Q5STATE SPACE SEARCH\ A gameboard is made of hexagonal tiles, allowing 6 directions of movement from each tile:\ north, s…
  6. Q6STATE SPACE SEARCH\ A gameboard is made of hexagonal tiles, allowing 6 directions of movement from each tile:\ north, s…
  7. Q7SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  8. Q9SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  9. Q10SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  10. Q11SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  11. Q12SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  12. Q13SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  13. Q14SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  14. Q15Select the formulas that are in Conjunctive Normal Form.
  15. Q16Perturbation method(s) used for TSP tour creation is/are .
  16. Q17If a genetic algorithm prematurely converges to a homogeneous suboptimal population, then which modification will preve…
  17. Q18If you initially implement Breadth-First Search using First-In-First-Out Queue and later replace the queue with Max-Pri…
  18. Q19In the Simulated Annealing schedule, if the temperature parameter T drops to absolute zero very early in the search pro…
  19. Q20TSP\ Figure shows a distance matrix for 5 cities, use it to construct TSP tours. Based on the above data, answer the gi…
  20. Q21TSP\ Figure shows a distance matrix for 5 cities, use it to construct TSP tours. Based on the above data, answer the gi…
  21. Q22TSP\ Figure shows a distance matrix for 5 cities, use it to construct TSP tours. Based on the above data, answer the gi…
  22. Q23A major drawback of Nearest Neighbour Heuristic for TSP is .
  23. Q24What is the core principle used in the Savings Heuristic for TSP?
  24. Q25The savings S(a,b) for two cities a and b relative to base/fulcrum city n is , where C(x,y) is the distance between cit…