Artificial Intelligence- Constraint Satisfaction Problems

Анульовано Опубліковано %project.relative_time Оплачується при отриманні
Анульовано Оплачується при отриманні

1. A .var file that contains the variables in the CSP to be solved and their domains. Each line of the ?le contains a variable (represented by a single letter), followed by a colon and its possible values, each of which is an integer. For instance, the line "A: 1 2 3" indicates that the possible values for variable A are 1, 2, and 3. Note that there is a space separating the

domain values.

2. A .con file that contains the constraints. Each line corresponds to exactly one constraint, which involves two variables and has the form VAR1 OP VAR2. VAR1 and VAR2 are the names of the two variables involved, and OPcan be one of four binary operators: = (equality),

! (inequality), > (greater than), and < (less than).

3. The consistency-enforcing procedure, which can take one of two values: none and fc. If none is used, no consistency-enforcing procedure is applied, and the solver simply uses backtracking to solve the problem. fcindicates that the solver will use forward checking to enforce consistency.

4. The variable ordering heuristic, which can take one of two values: alpha and mcv. If alpha is used, the variables should be ordered alphabetically. On the other hand, mcv indicates that the most constrained variable heuristic should be used, with ties broken using

the most constraining variable heuristic; if more than one variable still remains, break ties alphabetically.

5. The value ordering heuristic, which can take one of two values: inc and lcv. If inc is used, the values should be ordered so that smaller values will be assigned before larger values. On the other hand, lcv indicates that the least constraining value heuristic should be used; if more than one value still remains, break ties by preferring smaller values.

Your program should allow exactly these ?ve arguments to be speci?ed in the command line invocation of your program, in the order in which they are listed above. Your program should write to print "stdout" the ?rst 30 branches visited in the search tree (or stop when the solution is reached). Write them in text form with each branch on one line.

## Deliverables

The attachment is a sample .

Java

ID Проекту: #3128588

Про проект

1 заявка Дистанційний проект Остання активність Mar 6, 2011

1 фрілансер у середньому готовий виконати цю роботу за $128

aprasadvw

See private message.

$127.5 USD за 5 дні(-в)
(1 відгук)
0.0