Q2 Local Search: Ghost House 3 Points The same CSP constraints from above, repeated for your convenience: - Each starting spot fits exactly one ghost. - B>P (Blinky would like a higher starting spot number than Pinky.) - BI=1 (Inky and Blinky would like to be next to each other.) - P=1 (Pinky doesn't want to be at the first spot.) Instead of running backtracking search, we decide to run iterative improvement with the minconflicts heuristic for value selection. Let's assume the starting assignment is B=4,P=2,I=1,C=3. 1 Point Recall that a "sideways move" in local search refers to changing the current state to a neighboring state with the same (but not better) heuristic value. If sideways moves are allowed, what is the minimum number of iterations needed for local search to change the starting assignment into a satisfying assignment? 0 1 2 3 4 More than 4 Local search will not find a satisfying assignment. Q2.3 1 Point If sideways moves are not allowed, what is the minimum number of iterations needed for local search to change the starting assignment into a satisfying assignment? 0 1 2 3 4 More than 4 Local search will not find a satisfying assignment