# Constraint satisfaction problem | Computer Science homework help

## Problem 2 – CSP

Consider the following constraint satisfaction problem. A linear graph has nodes of the following colors:

– Red

– Yellow

– Green

– Blue

– Violet

Each node has a domain of {1, 2, …, 9}.

Each node type has the following constraints on its value:

– Red – No contraints

– Yellow – equals the rightmost digit of of the product of all its neighbors

– Green – equals the rightmost digit of the sum of all its neighbors

– Blue – equals the leftmost digit of the sum of all its neighbors

– Violet – equals the leftmost digit of the product of all of its neighbors

As a reminder here is the pseudo code for the Min-Conflicts search algorithm:

![minconflicts](https://images2017.cnblogs.com/blog/1126979/201712/1126979-20171224140802287-1871895433.png)

**Notes:**

– It’s possible that you won’t converge to a solution in a single run. Try a few runs to see if you get to a solution.

– The example is to show you what a problem looks like, we will test/grade your program on different examples

Complete the function *solve_csp* defined below. You may find some helper functions useful.

## Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
\$26
The price is based on these factors:
Number of pages
Urgency
Basic features
• Free title page and bibliography
• Unlimited revisions
• Plagiarism-free guarantee
• Money-back guarantee
On-demand options
• Writer’s samples
• Part-by-part delivery
• Overnight delivery
• Copies of used sources
Paper format
• 275 words per page
• 12 pt Arial/Times New Roman
• Double line spacing
• Any citation style (APA, MLA, Chicago/Turabian, Harvard)

# Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

### Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

### Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

### Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.