This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSC384 Test 2 Sample Questions (Backtracking Search, Knowledge Representation) 1. Consider the following CSP with 3 variables X,Y and Z : Dom ( X ) = { 1 , ··· , 10 } , Dom ( Y ) = { 5 , ··· , 15 } , and Dom ( Z ) = { 5 , ··· , 20 } , and binary constraints: C ( X,Y ) : X > Y , C ( Y,Z ) : Y + Z = 12, and C ( X,Z ) : X + Z = 16. a) Draw the constraint graph. b) Are the constraints arc consistent ? If no, apply arc consistency method repeatedly so they become arc consistent. What is the updated domain of each variable? 2. Consider the NQueens problem. That is, the problem of placing N Queens on an N × N chessboard so that no two Queens can attack each other. Find the first solution to the 5Queens problem by using the Forward Checking algorithm with dynamic variable reordering using the heuristic that we always instantiate next that variable with smallest remaining number of elements in its domain, breaking ties in favor of the lowest numbered variable....
View
Full Document
 Fall '05
 Sheila
 Artificial Intelligence, Backtracking, Forward Checking Algorithm, dynamic variable reordering

Click to edit the document details