Abstract
This paper presents a fast algorithm for solving the n-queens problem. The basic idea is that many cases can be solved using pre-computed solutions, while the remaining cases are solved by calling the Sosic algorithm [1]. The novelty of the paper is in the observation that these precomputable cases exhibit a modular nature, i.e. they can be applied to 3/4 of the cases. The speedup for these cases is about 10 times faster than those solved using Sosic algorithm.
Author supplied keywords
Cite
CITATION STYLE
El-Qawasmeh, E., & Al-Noubani, K. (2004). A polynomial time algorithm for the n-queens problem. In Proceedings of the IASTED International Conference on Neural Networks and Computational Intelligence (pp. 191–195). https://doi.org/10.1145/101340.101343
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
