The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other.
The queens order returns without attacking each other. We use "Simulated annealing". It is a metaheuristic search algorithm for global optimization problems. The general objective of this type of algorithm is to find a good approximation to the optimal value of a function in a large search space.
The name comes from the process of annealing steel and ceramics, a technique that involves heating and then slowly cooling the material to vary its physical properties.
