Please , i need an answer to the 25 Exercise of 9th edition java , i was searching in the solution book , but didnt find nothing , by the way , i cant copy the answer

Chapter 7, Problem 25E Bookark Show all steps: ON Chapter G Chapter H Chapter 1 Chapter 2 Y Chapter 3Y Chapter 4Y Chapter 5 Chapter 6 Chapter 7 (Eight Queens: Brute-Force Approaches) In this exercise, you'll develop several brute-force approaches to solving the Eight Queens problem introduced in Exercise a) Use the random brute-force technique developed in Exercise to solve the Eight Queens problem. b) Use an exhaustive technique (ie., 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. Exercise (Knight's Tour: Brute-Force Approaches) In part (C) of Exercise, we developed a solution to the Knight's Tour problem. The approach used, called the "accessibility heuristic," generates many solutions and executes efficiently As computers continue to increase in power, we'll be able to solve more problems with sheer computer power and relatively unsophisticated algorithms. Let's call this approach "brute-force" problem solving a) Use random-number generation to enable the knight to walk around the chessboard (in its legitimate L-shaped moves) at random. Your application should run one tour and display the final chessboard. How tar did the knight get? b) Most likely, the application in part (a) produced a relatively short tour. Now modify your application to attempt 1,000 tours. Use a one-dimensional amay to keep track of the number of tours of each length. When your application finishes attempting the 1,000 tours, it should display this information in neat tabular format. What was the best result? GE 7E 8E 9E 10E 11E 12E 13E C) Most likely, the application in part (b) gave you some "respectable" tours, but no full tours. Now let your application run until it produces a full tour. [Caution: This version of the application could run for hours on a powerful computer] Once again, keep a table of the number of tours of each length, and display this table when the first full tour is found. How many tours did your application attempt before producing a full tour? How much time did it take? d) Compare the brute-force version of the Knight's Tour with the accessibility-heuristic version 14E 15E 16E 17E Chapter 7, Problem 25E Bookark Show all steps: ON Chapter G Chapter H Chapter 1 Chapter 2 Y Chapter 3Y Chapter 4Y Chapter 5 Chapter 6 Chapter 7 (Eight Queens: Brute-Force Approaches) In this exercise, you'll develop several brute-force approaches to solving the Eight Queens problem introduced in Exercise a) Use the random brute-force technique developed in Exercise to solve the Eight Queens problem. b) Use an exhaustive technique (ie., 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. Exercise (Knight's Tour: Brute-Force Approaches) In part (C) of Exercise, we developed a solution to the Knight's Tour problem. The approach used, called the "accessibility heuristic," generates many solutions and executes efficiently As computers continue to increase in power, we'll be able to solve more problems with sheer computer power and relatively unsophisticated algorithms. Let's call this approach "brute-force" problem solving a) Use random-number generation to enable the knight to walk around the chessboard (in its legitimate L-shaped moves) at random. Your application should run one tour and display the final chessboard. How tar did the knight get? b) Most likely, the application in part (a) produced a relatively short tour. Now modify your application to attempt 1,000 tours. Use a one-dimensional amay to keep track of the number of tours of each length. When your application finishes attempting the 1,000 tours, it should display this information in neat tabular format. What was the best result? GE 7E 8E 9E 10E 11E 12E 13E C) Most likely, the application in part (b) gave you some "respectable" tours, but no full tours. Now let your application run until it produces a full tour. [Caution: This version of the application could run for hours on a powerful computer] Once again, keep a table of the number of tours of each length, and display this table when the first full tour is found. How many tours did your application attempt before producing a full tour? How much time did it take? d) Compare the brute-force version of the Knight's Tour with the accessibility-heuristic version 14E 15E 16E 17E