In this exercise, you’ll develop several brute-force approaches to solving the Eight Queens problem introduced in Exercise 6.24.

a) Use the random brute-force technique developed in Exercise 6.23 to solve the Eight Queens problem.

b) Use an exhaustive technique (i.e., try all possible combinations of eight queens on the chessboard) to solve the Eight Queens problem.

c) Why might the exhaustive brute-force approach not be appropriate for solving the Knight’s Tour problem?

d) Compare and contrast the random brute-force and exhaustive brute-force approaches.

Transcribed Image Text:

* * * * * * *