N-Queens Solver
Status: Complete | Last Updated: 2011/02/18 | Author(s): stt@sfu.ca
Small Java program that implements backtracking depth-first search to solve the n-queens problem. The search does not differentiate between distinct and unique solutions. The difference between the two is described below.
A unique solution is one that is not only distinct but remains distinct even if the solution board was transformed (rotations or reflections). Thus if solution A matches solution B if solution A's board is rotated 90 degrees ... the solution is distinct but not unique.
The search can also be threaded. That is, multiple threads can search slices of an empty board in parallel. For example...Thread 1 searches the top half of an 8x8 board and Thread 2 searches the bottom half.