Constraint Satisfaction Problem(Determininistic Method)

More realistically, suppose that its time to register for classes for Spring 2020. You have completed an AS degree in Computer Science and have completed your GELS courses as well. You need the following 10 courses to graduate (two of which, 352 and 425, are electives that you really want):

ICS 311, 340, 352, 365, 372, 425, 440, 460, 462, 499.

You want to complete these 10 courses in 3 semesters (crazy, I know). You know that the schedule of these courses for spring, summer, and fall of 2020 is as follows, with nights and locations listed.

Key for Days: M = Monday, T = Tuesday, W = Wednesday, H = Thursdy, S = Saturday

Key for Locations: m = Midway, n = Normandale, s = St. Paul, x = Minneapolis

So Mn, Ts, Hm means the course is offered Mondays at Normandale, Tuesdays at St. Paul, and Thursdays at Midway).

Course	Spring	Summer	Fall
311	Mn, Tm, Hs	Mm, Ws	Mm, Wx, Hs
340	Mn, Hs	Wm	Mn, Hm
352			Ws
365	Ts, Wn	Mm	Ms, Wn
372	Tm, Hn	Hm	Hn
425			Hs
440	Mm, Hn	Hm	Hs
460	Tn	Tn	Tn, Ws
462	Mm, Wn	Ms	Mn, Hs
499	Ts, Wm, Hn	Wx, Ss	Mm, Ts, Wn

Question:

Thus far we have talked about deterministic methods of solving CSPs: generate-and-test, backtracking, search, arc consistency, and variable elimination.

Suppose you want to find all possible schedules that will meet the prerequisites, have you taking no more than 4 courses in any one semester, and not have you taking two courses on the same day in the same semester. Which of the above methods would you use? Would you use more than one in sequence? Why did you make this choice (very important).

Answer this question on the next page, using no more room than that page.

A typed answer would be preferable to a hand-written one, but no point deduction for writing a legible handwritten answer. You can also type the answer to problem 1 above, since no justification is needed.