Quiz Space

AI: Search Methods for Problem Solving · End Term · 13 Apr 2025 · January 2025 term

Question 25: CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y a…

Question 25

+1 markWritten answer

CONSTRAINT SATISFACTION
The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedral objects is provided below. The in-plane clockwise/counterclockwise rotations of these junctions are valid as well. These junctions provide constraints on the possible edge assignments (convex, concave, arrow) for the edges/lines in 2D line drawings of trihedral objects.
The junctions carry unique labels: L1, L2, L3, L4, L5, L6, T1, T2, T3, T4, W1, W2, W3, Y1, Y2, Y3. When required, use the labels in short answers.

Note: A 2D line drawing of trihedral objects is considered to be consistent if all the edges and junctions can be assigned labels that are consistent with each other, otherwise the drawing is considered to be inconsistent and all labels are reset to NIL.
Apply a suitable algorithm to assign consistent labels to edges/junctions in the 2D line drawings in the sub-questions. Choose a suitable edge and junction order for solving the problems. Based on the above data, answer the given subquestions.

Assign consistent labels to all the edges and junctions in the 2D line drawing shown below. Enter the labels of the junctions 1, 2, 3, 4 in the text box, in that order. Or enter NIL if the drawing has no consistent label assignment.

Enter a comma separated list of junction labels, or enter NIL.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X9,Y9,Z9,W9

Show answer

Correct answer: Y1,W1,L5,T4 or Y2,W2,L5,T4

Question 25 of 26 in 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 (IIT M IMPROVEMENT AN EXAM QIM3 13 Apr 2025). It carries 1 mark.

More questions from this paper

  1. Q1ASK FOR PRINTED GRAPH SHEETS 16 PAGES DOUBLE-SIDED PRINT
  2. Q2SEARCH\ The figure shows a map on a uniform grid where each tile is 10x10 in size.\ The start node is S and the goal no…
  3. Q3SEARCH\ The figure shows a map on a uniform grid where each tile is 10x10 in size.\ The start node is S and the goal no…
  4. Q4SEARCH\ The figure shows a map on a uniform grid where each tile is 10x10 in size.\ The start node is S and the goal no…
  5. Q5SEARCH\ The figure shows a map on a uniform grid where each tile is 10x10 in size.\ The start node is S and the goal no…
  6. Q6SEARCH\ The figure shows a map on a uniform grid where each tile is 10x10 in size.\ The start node is S and the goal no…
  7. Q7TSP Branch-and-Bound In the given search problem, how many nodes were refined in order to discover the optimal tour? En…
  8. Q8TSP Branch-and-Bound Which node represents the optimal tour and what is the cost of the optimal tour? Enter the node re…
  9. Q9TSP Branch-and-Bound Determine the number of cities in the TSP instance. Enter the number of cities in the text box, or…
  10. Q10TSP Branch-and-Bound Start from city A, what is the path representation of the optimal tour? Enter the path\ representa…
  11. Q11GAMES\ The figure shows a game tree with evaluation function values at the horizon nodes.\ The horizon nodes are labele…
  12. Q12GAMES\ The figure shows a game tree with evaluation function values at the horizon nodes.\ The horizon nodes are labele…
  13. Q13GAMES\ The figure shows a game tree with evaluation function values at the horizon nodes.\ The horizon nodes are labele…
  14. Q14GAMES\ The figure shows a game tree with evaluation function values at the horizon nodes.\ The horizon nodes are labele…
  15. Q15PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  16. Q16PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  17. Q17PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  18. Q18RULE BASED EXPERT SYSTEMS\ A small part of the Rete Net for classifying resistors is shown in the figure. The labels A1…
  19. Q19RULE BASED EXPERT SYSTEMS\ A small part of the Rete Net for classifying resistors is shown in the figure. The labels A1…
  20. Q20RULE BASED EXPERT SYSTEMS\ A small part of the Rete Net for classifying resistors is shown in the figure. The labels A1…
  21. Q21AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Consider the…
  22. Q22AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Consider the…
  23. Q23AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Consider the…
  24. Q24AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Consider the…
  25. Q26CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…