I have asked in the previous question the data structure I will follow for solving the N Queens problem.
Here is my previous question about N -queens algorithm.
It is better to read it first to understand this question.
I want to ask how can i now move the queens randomly according to the number of conflicts they have?
The bigger the number of conflicts the bigger probability to move further. The queens are also restricted in the N x N space.
I don't want to follow a hill climbing approach but a simulated annealing algorithm where in the beginning i will have big probability to accept bad soution .