There are probabilistic heuristic which provide linear-like performance Look for the article "3000000 queens in less than one minute" by Rok Sosic
On 2/24/07, Vishal <[EMAIL PROTECTED]> wrote: > > It uses backtracking (DFS with tree pruning). So exponential. > > On 2/24/07, amin <[EMAIL PROTECTED]> wrote: > > > > > > Hi Dear > > what is the best order in this problem? > > > > N-queens Problem' > > > > > > > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
