Waiting for answer This question has not been answered yet. You can hire a professional tutor to get the answer.
Artificial Intelligence Assignment
Constraint Satisfaction Problems
Resources to consult:
https://cis.temple.edu/~giorgio/cis587/readings/constraints.html#2
http://artint.info/html/ArtInt_78.html
Specific questions or items to address:
In couple paragraphs, explain what are the Constraint Satisfaction problems, and list some of the characteristics of CSP.
There are 3 solutions for Constraint Satisfaction Problems:
Generate-and-Test
Backtracking
Consistency Driven.
Describe each CSP solution, and for each solution, provide examples of its usage.
8 Queens problem
The local condition is:
- no two queens attack each other
-no two queens are on the same row,
- no two queens are on the same column,
- no two queens are on the same diagonal line.
Problem: place 8 queens on a standard 8x8 chessboard so that no queen is attacking another queen.
For this CSP problem, you are to implement a backtrack depth-first search in cLISP, that takes as input an integer and solves the corresponding 8-queens problem.
Criteria: (# pages, APA format, etc.)
Please use submit your assignment via a Word or Google doc, with annotated screenshots where applicable.
Your document should have the following components:
Title page
Course number and name
Project name
Student name
Date
- Reference page
- Take screenshots of functions running in cLISP, and paste it in the Word document. Provide a description for each screenshot.
