Quiz Space

AI: Search Methods for Problem Solving · End Term · 31 Aug 2025 · May 2025 term · Set QDB1

Question 28: CONSTRAINT SATISFACTION Consider a map colouring problem…

Question 28

+1 markWritten answer

CONSTRAINT SATISFACTION

Consider a map colouring problem with 3 regions {A,B,C}, where all three regions are adjacent to each other, and the regions are being processed in the order A,B,C.

The domains are:

DA={r,b,g}D_A = \{r, b, g\}

DB={r,b}D_B = \{r, b\}

DC={r,b}D_C = \{r, b\}

Draw the constraint graph for the above problem and answer the sub-questions.

Does the given CSP have a solution? Enter the solution for regions A,B,C as a comma separated list of colours. Enter NIL if there is no solution.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: r,b,r

Show answer

Correct answer: g,r,b or g,b,r

See the whole paperTake it as a mock test

Question 28 of 28 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 31 Aug 2025, in the May 2025 term (IIT M DIPLOMA AN EXAM QDD3 31 Aug 2025). It carries 1 mark.

More questions from this paper

  1. Q1Figure question
  2. Q2What is the path found by the Best First Search algorithm? Enter the path as a comma separated list of node labels.\ NO…
  3. Q3NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.\ Answer format: S,X,Y,Z
  4. Q4What is the path found by Branch-and-Bound search algorithm? Enter the path as a comma separated list of node labels.\ …
  5. Q5For the given map, which algorithm finds the shortest path from S to G?
  6. Q6Select the correct statement(s) about the given graph.
  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. Q11TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  12. Q12GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  13. Q13GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  14. Q14GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  15. Q15GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  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. Q18PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  19. Q19RULE BASED EXPERT SYSTEMS\ A Rete Net for a rule based system to identify engines, turbines and motors is shown in the …
  20. Q20RULE BASED EXPERT SYSTEMS\ A Rete Net for a rule based system to identify engines, turbines and motors is shown in the …
  21. Q21RULE BASED EXPERT SYSTEMS\ A Rete Net for a rule based system to identify engines, turbines and motors is shown in the …
  22. Q22AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Based on the…
  23. Q23AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Based on the…
  24. Q24AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Based on the…
  25. Q25AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Based on the…
  26. Q26CONSTRAINT SATISFACTION Consider a map colouring problem with 3 regions {A,B,C}, where all three regions are adjacent t…
  27. Q27CONSTRAINT SATISFACTION Consider a map colouring problem with 3 regions {A,B,C}, where all three regions are adjacent t…