[2021] COMPSCI 367 Artificial Intelligence - Final Exam - Question 17 Backtracking Algorithm
This question has been solved
17 The following graph shows the adjacency of regions in Western Canada. You’d like to give a colour from {R,G,B} to each node so that no two adjacent nodes get the same colour.
CourseNana.COM
CourseNana.COM
CourseNana.COM
We model this problem as a CSP with variables: YU, NT, BC, AL, NU, SA, MA, whose domains are all {R,G,B} and the constraints indicate that any adjacent nodes would be assigned different values.
CourseNana.COM
- Starting from the partial assignment f(AL)=B, f(MA)=R, and assuming the initial domain of all other nodes is {R,G,B}, apply the arc consistency (AC3) algorithm. Write down the remaining values in the domain of each node after the algorithm is completed.
- Starting from the node YU with assignment f(YU)=R, apply the backtracking algorithm, where the Select-Unassigned-Var operation is implemented using two heuristics: First, apply MRV heuristic to choose a value, and then use the degree heuristic as a tie breaker. Write down, in the same order as done by the backtracking algorithm, the list of nodes and their assigned colours.
The answers to both questions are meant to go into the one textbox at the bottom of the question.
CourseNana.COM
Fill in your answer here
CourseNana.COM
CourseNana.COM
COMPSCI 367代写,Artificial Intelligence代写,Markov Decision Process代写,THE UNIVERSITY OF AUCKLAND代写,Backtracking Algorithm代写,COMPSCI 367代编,Artificial Intelligence代编,Markov Decision Process代编,THE UNIVERSITY OF AUCKLAND代编,Backtracking Algorithm代编,COMPSCI 367代考,Artificial Intelligence代考,Markov Decision Process代考,THE UNIVERSITY OF AUCKLAND代考,Backtracking Algorithm代考,COMPSCI 367help,Artificial Intelligencehelp,Markov Decision Processhelp,THE UNIVERSITY OF AUCKLANDhelp,Backtracking Algorithmhelp,COMPSCI 367作业代写,Artificial Intelligence作业代写,Markov Decision Process作业代写,THE UNIVERSITY OF AUCKLAND作业代写,Backtracking Algorithm作业代写,COMPSCI 367编程代写,Artificial Intelligence编程代写,Markov Decision Process编程代写,THE UNIVERSITY OF AUCKLAND编程代写,Backtracking Algorithm编程代写,COMPSCI 367programming help,Artificial Intelligenceprogramming help,Markov Decision Processprogramming help,THE UNIVERSITY OF AUCKLANDprogramming help,Backtracking Algorithmprogramming help,COMPSCI 367assignment help,Artificial Intelligenceassignment help,Markov Decision Processassignment help,THE UNIVERSITY OF AUCKLANDassignment help,Backtracking Algorithmassignment help,COMPSCI 367solution,Artificial Intelligencesolution,Markov Decision Processsolution,THE UNIVERSITY OF AUCKLANDsolution,Backtracking Algorithmsolution,
