An efficient non-probabilistic search algorithm for the N-queens problem

Authors:
Jing-Chao Chen
Affiliations:
School of Informatics, Donghua University, Shanghai, P.R. China
Venue:
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Year:
2007

Citing 7
Cited 1

A note on the queens' problem

Information Processing Letters
Efficient search techniques—an empirical study of the N-Queens problem

IBM Journal of Research and Development
An almost perfect heuristic for the N nonattacking queens problem

Information Processing Letters
A polynomial time algorithm for the N-Queens problem

ACM SIGART Bulletin
Explicit solutions to the N-queens problem for all N

ACM SIGART Bulletin
3,000,000 Queens in less than one minute

ACM SIGART Bulletin
Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem

IEEE Transactions on Knowledge and Data Engineering

New decision rules for exact search in N-Queens

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.