6 points for each problem.
1) Backtracking
Consider the backtracking algorithm for solving the eight-queens problem
given on the slides.
Draw that part of the implicit graph created by the algorithm that includes the first 12 nodes that are accessed
and the edges between them (failure nodes are not counted). For each node, give the corresponding vector.
2) Problem 9.29
3) Exercise 2 in the handout, page 391
4) Exercise 7 in the handout, page 391