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.
http://www.experts-exchange.com/Programming/Q_21810242.html
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 think one possible heuristic would be to move the queen having the largest number of conflicts to a square in the same column where the number of conflicts would be minimum. Eventually, you will reach a solution.
_______________
Nayer Naguib