Due
Mar 2, 2020 by
2:10pm
Points
1
Available
after Mar 2, 2020 at 2pm
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.
1583176200
03/02/2020
02:10pm
Rubric
Can't change a rubric once you've started using it.
Title
You've already rated students with this rubric. Any major changes could affect their assessment results.
Title
Criteria
Ratings
Pts
This criterion is linked to a Learning Outcome
Description of criterion
threshold:
5 pts
5
to >0 pts
Full Marks
blank
0
to >0 pts
No Marks
blank_2
This area will be used by the assessor to leave comments related to this criterion.
/
5 pts
--
This criterion is linked to a Learning Outcome
Description of criterion
threshold:
5 pts
5
to >0 pts
Full Marks
blank
0
to >0 pts
No Marks
blank_2
This area will be used by the assessor to leave comments related to this criterion.
/
5 pts
--
Total Points:
5
out of 5
Find Rubric