J.-C. Chen (PRC)
N queens, non-random, greedy heuristic search, Quasi conflict minimization, non-backtracking
We present a new heuristic search for the N-queens problem, which is neither backtracking nor random search. This algorithm finds systematically a solution in linear time. Its speed is faster than the fastest algorithm known so far. On an ordinary personal computer, it can find a solution for 3000000 queens in less than 5 seconds.
Important Links:
Go Back
