constraint satisfaction problem
Budget: €30 – €250 EUR
*use a constraint framework to solve the constraint satisfaction problem in the attached file
*demonstrate whether this problem can be done with other search method like dfs, bfs, dijsktra or A*(one will suffice)
*provide harvard referencing for the explanations
THIS PROJECT IS AS MUCH ABOUT THE CODE AS THE EXPLANATION, AS ITS MEANT TO SHOW INDEPTH UNDERSTANDING OF THE TOPIC SO THE CODE MUST BE PROPERLY COMMENTED AND ALSO TEXT CELLS SHOULD BE USED TO EXPLAIN IT INDEPTHLY
*submit as ipynb
PAYMENT IS FIXED AT 50EURO
*demonstrate whether this problem can be done with other search method like dfs, bfs, dijsktra or A*(one will suffice)
*provide harvard referencing for the explanations
THIS PROJECT IS AS MUCH ABOUT THE CODE AS THE EXPLANATION, AS ITS MEANT TO SHOW INDEPTH UNDERSTANDING OF THE TOPIC SO THE CODE MUST BE PROPERLY COMMENTED AND ALSO TEXT CELLS SHOULD BE USED TO EXPLAIN IT INDEPTHLY
*submit as ipynb
PAYMENT IS FIXED AT 50EURO