$)$ As you have solved the N$-$Queens problem in the previous homework using

Simulated Annealing and Genetic algorithms, your task now is the same, but with

using Min$-$conflicts technique relying on the constraint satisfaction problems.

Make sure that your Python program is well$-$documented $($i$.$e$.,$ writing enough

comments that clearly explain your code$)$ and executable with no

syntax$/$compiling errors.

$($b$)$ Discuss in some details the similarities and differences between your solutions

in the previous homework and this one.$($a$)$ As you have solved the $N-$ Queens problem in the previous homework using

Simulated Annealing and Genetic algorithms, your task now is the same, but with

using Min$-$conflicts technique relying on the constraint satisfaction problems.

Make sure that your Python program is well$-$documented $($i$.$e$.,$ writing enough

comments that clearly explain your code$)$ and executable with no

syntax$/$compiling errors.

$($b$)$ Discuss in some details the similarities and differences between your solutions

in the previous homework and this one.