Revise the program that you just wrote for the Eight Queens problem so that it answers the following questions:
a. How many backtracks occur? That is, how many times does the program remove a queen from the board?
b. How many calls toisUnderAttack are there?
c. How many recursive calls toplaceQueens are there?
d. Can you makeisUnderAttack more efficient? For example, as soon as you detect that a queen can attack a given square, do you still look for another queen?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.