We are supposed to use forward checking and backtracking on a constraint satisfaction problem.

The input for variables would be in the form of

A: 1 2 3 4 5 B: 1 2 3 4 5 C: 1 2 3 4 5 D: 1 2 3 4 5 E: 1 2 3 F: 1 2 

The input for constraints would be in the form of

A > B B > F A > C C > E A > D D = E 

The solution with backtracking should look like this

1. F=1, E=1, A=5, B=1 failure 2. F=1, E=1, A=5, B=2, C=1 failure 3. F=1, E=1, A=5, B=2, C=2, D=1 solution 

The solution for forward checking should look like this

1. F=1, E=1, D=1, A=5, B=2, C=2 solution 

Any help would be great!

In this problem, you will implement a CSP solver that takes exactly three arguments from the command line 1. A .var file that contains the variables in the CSP to be solved and their domains. Each line of the file 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 2Acon 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 OP can be one of four binary operators: = (equality), ! (inequality), > (greater than), and (greater than), and