(Solved) : Help Question Simulated Annealing N Queens Problem Requires Place N Queens N N Chessboard Q35419600 . . . .

Help me with this question

Simulated Annealing

The n-queens problem requires you to place nqueens on an n ´ n chessboard such that no queenattacks another queen. (A queen attacks any piece in the same row,column or diagonal.).

• We define the states to be any configuration where then queens are on the board, one per column.
• The move set includes all possible states generated by moving asingle queen to another square in the same column. The function toobtain these states is called the successor function.
• The evaluation functionf(state) is thenumber of non-attacking pairs of queensin this state.

1. [5] How many possible states are there?
2. [5] For
   OR

    

   PayPal Gateway not configured

   OR

    

   PayPal Gateway not configured