Back to Search
Start Over
REDUCING THE TIME COMPLEXITY OF THE N-QUEENS PROBLEM.
- Source :
-
International Journal on Artificial Intelligence Tools . Jun2005, Vol. 14 Issue 3, p545-557. 13p. - Publication Year :
- 2005
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02182130
- Volume :
- 14
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- International Journal on Artificial Intelligence Tools
- Publication Type :
- Academic Journal
- Accession number :
- 17189960
- Full Text :
- https://doi.org/10.1142/S0218213005002247