Date: 12/01/05 (Algorithms)    Keywords: no keywords

Hello, I'm new to this community (mostly due to not looking into communities on LJ), and have a quick question.

How would the fastest algorithm to tackle the N-Queens problem be written? I currently have a depth-first search written in C++, but this runs too slow for higher values of N. Also, could someone provide hints or help on how to incorporate symmetry into the program? Any help would be greatly appreciated, thanks.

Source: http://www.livejournal.com/community/algorithms/67606.html