Suppose we are trying to solve the n-Queens problem with a fairly large n (say, 1,000). Which CSP solving method do you think will find the solution faster: Backtracking+constraint propagation+MRV+LCV or Iterative Improvement? Explain.
158317620003/02/202002:10pm
Additional Comments:
Rubric
Can't change a rubric once you've started using it.
Find Rubric
