Abstract
This paper presents a fast algorithm for solving the n-queens problem.
The basic idea of this algorithm is to use pre-computed solutions in 75%
of the cases, while the remaining cases are solved by calling the Sosic's
algorithm. The novelty of this algorithm is in the observation that these
pre-computable cases exhibit a modular nature. In addition, the pre-computed
solutions run 100 times faster than Sosic's algorithm in most cases.