Quiz Space

AI: Search Methods for Problem Solving · End Term · 24 Dec 2023 · September 2023 term · Set FDB1

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. Otherwise 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: L9,Y9,T9,W9

Show answer

Correct answer: Y1,W1,Y3,W2 or Y1,W2,Y3,W1 or Y2,W2,Y3,W2 or Y3,W3,Y2,W3

Question 25 of 26 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 24 Dec 2023, in the September 2023 term (IIT M DEGREE FN EXAM FDB1 24 Dec 2023). It carries 1 mark.

More questions from this paper

  1. Q1Printed graph sheets (hard copy) will be provided for registered candidates only. ASK FOR PRINTED GRAPH SHEETS 10 PAGES…
  2. Q2SEARCH\ 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…
  3. Q3SEARCH\ 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…
  4. Q4SEARCH\ 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…
  5. Q5SEARCH\ 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…
  6. Q6SEARCH\ 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…
  7. Q7TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  8. Q8TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  9. Q9TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  10. Q10TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  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 part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the fi…
  19. Q19RULE BASED EXPERT SYSTEMS\ A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the fi…
  20. Q20RULE BASED EXPERT SYSTEMS\ A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the fi…
  21. Q21AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. PREDICATES O…
  22. Q22AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. PREDICATES O…
  23. Q23AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. PREDICATES O…
  24. Q24AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. PREDICATES O…
  25. Q26CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…