# Question: Give precise formulations for each of the following as constrain

Give precise formulations for each of the following as constraint satisfaction problems:

a. Rectilinear floor-planning: find non-overlapping places in a large rectangle for a number of smaller rectangles.

b. Class scheduling: There is a fixed number of professors and classrooms, a list of classes to be offered, and a list of possible time slots for classes. Each professor has a set of classes that he or she can teach.

a. Rectilinear floor-planning: find non-overlapping places in a large rectangle for a number of smaller rectangles.

b. Class scheduling: There is a fixed number of professors and classrooms, a list of classes to be offered, and a list of possible time slots for classes. Each professor has a set of classes that he or she can teach.

**View Solution:**## Answer to relevant Questions

Solve the crypt arithmetic problem in Figure by hand, using backtracking, forward checking, and the MRV and least-constraining-valueheuristics.Suppose that a graph is known to have a cycle cut set of no more than k nodes. Describe a simple algorithm for finding a minimal cycle cut set whose runtime is not much more than Q(nk) for a CSP with n variables. Search the ...Consider the following procedure for choosing moves in games with chance nodes;• Generate some die-roll sequences (say, 50) down to a suitable depth (say, 8).• With known die rolls, the game tree becomes deterministic. ...Describe the wumpus world according to the properties of task environments listed.Any propositional logic sentence is logically equivalent to the assertion that each possible world in which it would be false is not the case. From this observation, prove that any sentence can be written in CNF.Post your question