The average complexity of depth-first search with backtracking and cutoff
IBM Journal of Research and Development
Efficient search techniques—an empirical study of the N-Queens problem
IBM Journal of Research and Development
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Representation Selection for Constraint Satisfaction: A Case Study Using n-Queens
IEEE Expert: Intelligent Systems and Their Applications
Performance measurement and analysis of certain search algorithms.
Performance measurement and analysis of certain search algorithms.
Explicit solutions to the N-queens problem for all N
ACM SIGART Bulletin
On a general framework for large-scale constraint-based optimization
ACM SIGART Bulletin
3,000,000 Queens in less than one minute
ACM SIGART Bulletin
Efficient local search for very large-scale satisfiability problems
ACM SIGART Bulletin
Different perspectives of the N-Queens problem
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Is eight enough?: the eight queens problem re-examined
ACM SIGCSE Bulletin
Isomorphism and the N-Queens problem
ACM SIGCSE Bulletin
Toward A Constraint-Satisfaction Frameworkfor Evaluating Program-Understanding Algorithms
Automated Software Engineering
Applying Plan Recognition Algorithms To Program Understanding
Automated Software Engineering
Trace-Based Methods for Solving Nonlinear Global Optimization and Satisfiability Problems
Journal of Global Optimization
A Discrete Lagrangian-Based Global-SearchMethod for Solving Satisfiability Problems
Journal of Global Optimization
Two Dogmas of Computationalism
Minds and Machines
Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem
IEEE Transactions on Knowledge and Data Engineering
Local Search for DAG Scheduling and Task Assignment
ICPP '97 Proceedings of the international Conference on Parallel Processing
ACM SIGCSE Bulletin
An efficient non-probabilistic search algorithm for the N-queens problem
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Unifying execution of imperative and declarative code
Proceedings of the 33rd International Conference on Software Engineering
A linear solution to the n-Queens problem using vector spaces
Journal of Computing Sciences in Colleges
| Hi-index | 0.00 |
The n-queens problem is a classical combinatorial problem in the artificial intelligence (AI) area. Since the problem has a simple and regular structure, it has been widely used as a testbed to develop and benchmark new AI search problem-solving strategies. Recently, this problem has found practical applications in VLSI testing and traffic control. Due to its inherent complexity, currently even very efficient AI search algorithms developed so far can only find a solution for the n-queens problem with n up to about 100. In this paper we present a new, probabilistic local search algorithm which is based on a gradient-based heuristic. This efficient algorithm is capable of finding a solution for extremely large size n-queens problems. We give the execution statistics for this algorithm with n up to 500,000.