> N-queens Problem'
One of the simplest heuristics for this problem is the min-conflicts hill climbing heuristic. You start with a random arrangement of the n queens and then try to improve upon the existing conflicts by re- arranging the queens locally. You should note that this heuristic does not guarantee a solution and random restarts might be required. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
