A Fast Heuristic Search Algorithm for the N-Queens Problem
Yinqing Wang · Computer Knowledge and Technology · 2009
The N-Queens problem is a classical combinatorial search problem, and is a tipical searching problem in the artificial intelligence(AI) area.Here we present a fast algorithms based on heuristic method, which can be capable of finding solution in short time.In personal computer, finding all solutions of 16-queens will be finished in 12.2 seconds.