CS4321 - Introduction to Algorithms: Homework Assignment 6

1. Exercise 11.3 Question 1 (page 401): Is chess decidable?

2. Exercise 11.3 Question 3 (page 402): Graph examples

3. Exercise 11.3 Question 7 (page 402): Decision version

4. Exercise 12.1 Question 4 (page 423): Backtracking example

6. Exercise 12.2 Question 5 (page 433): Branch and bound example

7. Exercise 12.3 Question 1 (page 451): Nearest neighbor example

8. Exercise 12.3 Question 7 (page 451): First-fit algorithm