Question

No need write a code. you can answer just the first 3 a,b and c

1. Following are the steps (algorithm) to obtain a solution for Queen Puzzle heuristically:
   1. Divide n by 12 Remember the remainder (n is 8 for the eight queens puzzle)
   2. Write a list of the odd numbers from 1 to n in order, if the remainder is 8, switch pairs (i.e. 3, 1, 7, 5. 11.9....)
   3. if the remainder is 2, Switch the places of 1 and 3, then move 5 to the end of the list
   4. if the remainder is 3 or 9, move 1 and 3 to the end of the list
   5. Append the even numbers from 2 to n in order
   6. if the remainder is 3 or 9. move 2 to the end of the list
   7. Place the first-column queen in the row with the first number in the list, place the second-column queen in the row with the second number in the list. Etc

Use the algorithm to get a sequence of placement of 15 queens. Besides not only one order but can be brave one specify 2 other different sequences [20]

Answer 1

Solution

As per you request

just writing the answer

1)

8/12

=8

2)

2,4,6,8...

3)

Not applicable

---

All the best