# Need executable programming code satisfying A) and B). It will be helpul if you can give README file

Need executable programming code satisfying A) and B). It will be helpul if you can give README file as well. 2. For the n-queens problem reflections or rotations of others. For example, when n = 4, the two solutions given in Figure 7.9 are we observe that some solutions are simply equivalent under reflection Observe that for finding inequivalent solutions the algorithm need only set 1 = 2, 3,…, n/21 computed (a) Modify NQueens so that only inequivalent solutions are (b) Run the n-queens program devised above for n = 8, 9, and 10 Tabulate the number of solutions your program finds for each value of n. 1 1. 2 2 | 3 3 4 4 15 6 (8,5,3,1,2,1)769 (8,5,4,3,2) 1649 1 2 2 4 4 5 6 (8,6.4,3,2) 1977 (8,6,4,2,1,1,)=1401 2 4 6 7 (8,5,3,2,2,1,,) = 2329 Figure 7.8 Five walks through the 8-queens problem plus estimates of the tree size 357 7.3. SUM OF SUBSETS 1 2 2 3 3 4 Figure 7.9 Equivalent solutions to the 4-queens problem

NEED HELP WITH SUCH A TASK? WE HAVE THE BEST TUTORS FOR YOU. ORDER NOW FROM 10\$/PG 