Grading Criterion for Homework 3
Artificial Intelligence
CS 470/670 , Fall 2009
Student Name:
_______________________________ TA: Pruet Boonma
Part 1: Local Search (0 to 80 pts)
Programming Completeness
1. Implement the 8‐ queens problem example ( 0 to 20 pts)
◦ The same h function defined in Slide 24 can be used, or a new objective
function can be used instead.
◦ The initial state should be generated randomly or accept a given input of the
positions of 8 queens.
2. Solve the problem using the simulated annealing algorithm ( 0 to 40 pts)

The program should output the initial state and the final goal state, mark the
location of the 8 queens using (col, row) coordinate.

The program should be able to accept two different inputs:
◦ A random initial state generated by the program itself
◦ A given initial state provided by your TA. Your program should allow the
TA enters the (col, row) positions of 8 queens.
Programming Documentation ( 0 to 20 pts)
1. The submitted program is well-documented; variable and function names are selfdescriptive and major functions are explained clearly in comments.
Part 2: Writing Assignment (0 to 20 pits)
1. Write a report no less than 200 words to discuss the design of the algorithm. For
example, the design of the schedule and iteration times, interesting experiences or
lessons learned in this assignment, etc.
Deductions:
1. Unbounded homework, No cover page, No/Incomplete README (5 pts/each)
◦ In the README file, specify your programming language and platform/OS
you use for writing your assignment.
2. Incorrect submitted file name (-5 pts)
3. No hard copies or soft copies (00 pts)
4. The submitted program is not written in supported languages (-100 pts)
◦ See http://www.cs.umb.edu/~ding/classes/470_670/student.htm for the list
of supported languages
Total Points (100 max):
Comment :
Points
1.______
2.______
1.______
1.______
1.______
2.______
3.______
4.______
_______