Quiz Space

AI: Search Methods for Problem Solving · Quiz 1 · 16 Oct 2022 · September 2022 term · Set QPG3

Question 2: Starting from board S, what is the shortest sequence of m…

Question 2

+1 markWritten answer

STATE SPACE
In the 8-puzzle, use the combination of tile-number (1 to 8) and the direction (Up, Down,Left, Right) of tile movement to denote a move, for example:
6U — move tile 6 up 2D — move tile 2 down 4L — move tile 4 left 8R — move tile 8 right
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?

Starting from board S, what is the shortest sequence of moves that will result in board G?

Show answer

Correct answer: 6D,8R,7U,6L

See the whole paperTake it as a mock test

Question 2 of 20 in 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 (2022 Oct: IIT M QUIZ 1 DEGREE QPG3). It carries 1 mark.

More questions from this paper

  1. Q1Starting from board G, the sequence of moves 8D,7R,6U,5U will result in . Starting from board G, the sequence of moves …
  2. Q3SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  3. Q4SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  4. Q5SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  5. Q6SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  6. Q7SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  7. Q8SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  8. Q9SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  9. Q10SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  10. Q11SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  11. Q12GENETIC ALGORITHM\ A tour of 12 cities is shown below. The edges are bi-directional. Use A,B,C,...,L as the reference (…
  12. Q13GENETIC ALGORITHM\ A tour of 12 cities is shown below. The edges are bi-directional. Use A,B,C,...,L as the reference (…
  13. Q14GENETIC ALGORITHM\ A tour of 12 cities is shown below. The edges are bi-directional. Use A,B,C,...,L as the reference (…
  14. Q15GENETIC ALGORITHM\ A tour of 12 cities is shown below. The edges are bi-directional. Use A,B,C,...,L as the reference (…
  15. Q16TSP\ The distance matrix for 7 cities and the corresponding edge costs (in sorted order) are provided below. Use this i…
  16. Q17TSP\ The distance matrix for 7 cities and the corresponding edge costs (in sorted order) are provided below. Use this i…
  17. Q18TSP\ The distance matrix for 7 cities and the corresponding edge costs (in sorted order) are provided below. Use this i…
  18. Q19TSP\ The distance matrix for 7 cities and the corresponding edge costs (in sorted order) are provided below. Use this i…
  19. Q20TSP\ The distance matrix for 7 cities and the corresponding edge costs (in sorted order) are provided below. Use this i…