Information Processing Letters
A simplified solution of the n queens` problem
Information Processing Letters
Efficient search techniques—an empirical study of the N-Queens problem
IBM Journal of Research and Development
Divide and conquer under global constraints: a solution to the N-queens problem
Journal of Parallel and Distributed Computing
An almost perfect heuristic for the N nonattacking queens problem
Information Processing Letters
Introduction to algorithms
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
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
Parallel algorithms and architectures for very fast AI search
Parallel algorithms and architectures for very fast AI search
Efficient local search for very large-scale satisfiability problems
ACM SIGART Bulletin
Backtrack programming techniques
Communications of the ACM
Performance measurement and analysis of certain search algorithms.
Performance measurement and analysis of certain search algorithms.
Constraint-Based Searching: Algorithms and Architectures
Constraint-Based Searching: Algorithms and Architectures
History cache: hardware support for reverse execution
ACM SIGARCH Computer Architecture News
Hierarchical constraint satisfaction in spatial databases
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Multi-agent oriented constraint satisfaction
Artificial Intelligence
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
Convergence Properties of Optimization Algorithms for the SAT Problem
IEEE Transactions on Computers
Global Optimization for Satisfiability (SAT) 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
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
New decision rules for exact search in N-Queens
Journal of Global Optimization
Evolutionary agents for n-queen problems
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
A local search system for solving constraint problems of declarative graph-based global constraints
INAP'04/WLP'04 Proceedings of the 15th international conference on Applications of Declarative Programming and Knowledge Management, and 18th international conference on Workshop on Logic Programming
| Hi-index | 0.00 |
Backtracking search is frequently applied to solve a constraint-based search problem, but it often suffers from exponential growth of computing time. We present an alternative to backtracking search: local search with conflict minimization. We have applied this general search framework to study a benchmark constraint-based search problem, the n-queens problem. An efficient local search algorithm for the n-queens problem was implemented. This algorithm, running in linear time, does not backtrack. It is capable of finding a solution for extremely large size n-queens problems. For example, on a workstation it can find a solution for 3000000 queens in less than 55 s.