Journal ArticleDOI
Explicit solutions to the N-queens problem for all N
Reads0
Chats0
TLDR
The n-queens problem is often used as a benchmark problem for AI research and in combinatorial optimization and a polynomial time algorithm for finding a solution was presented in this magazine.Abstract:
The n-queens problem is often used as a benchmark problem for AI research and in combinatorial optimization. An example is the recent article [1] in this magazine that presented a polynomial time algorithm for finding a solution. Several CPU-hours were spent finding solutions for some n up to 500,000.read more
Citations
More filters
Algorithms for the Satisfiability (SAT) Problem: A Survey,
TL;DR: This survey presents a general framework (an algorithm space) that integrates existing SAT algorithms into a unified perspective and describes sequential and parallel SAT algorithms including variable splitting, resolution, local search, global optimization, mathematical programming, and practical SAT algorithms.
Journal ArticleDOI
A survey of known results and research areas for n-queens
Jordan Bell,Brett Stevens +1 more
TL;DR: This paper surveys known results for the n-queens problem of placing n nonattacking queens on an nxn chessboard and considers extensions of the problem, e.g. other board topologies and dimensions, and investigates a number of open research areas.
Proceedings ArticleDOI
Makalu: fast recoverable allocation of non-volatile memory
TL;DR: This paper presents Makalu, a system that addresses non-volatile memory management and offers an integrated allocator and recovery-time garbage collector that maintains internal consistency, avoids NVRAM memory leaks, and is efficient, all in the face of failures.
Journal ArticleDOI
Efficient local search with conflict minimization: a case study of the n-queens problem
Rok Sosic,Jun Gu +1 more
TL;DR: This work has applied this general search framework to study a benchmark constraint-based search problem, the n-queens problem, and implemented an efficient local search algorithm, running in linear time, that does not backtrack.
Journal ArticleDOI
Complexity of n-queens completion
TL;DR: The n-Queens problem has been very widely used as a benchmark in Artificial Intelligence, but conclusions on it are often disputable because of the simple complexity of the decision problem, so these results give alternative benchmarks which are hard theoretically and empirically, but for which solving techniques designed for n- Queens need minimal or no change.
References
More filters
Journal ArticleDOI
A polynomial time algorithm for the N-Queens problem
Rok Sosic,Jun Gu +1 more
TL;DR: A new, probabilistic local search algorithm which is capable of finding a solution for extremely large size n-queens problems, based on a gradient-based heuristic is presented.
Journal ArticleDOI
Constructions for the Solution of the m Queens Problem
TL;DR: In this article, Constructions for the Solution of the m Queens Problem (mQP) have been proposed for solving the m-Queens Problem, where m is the number of queens.
Related Papers (5)
Efficient local search with conflict minimization: a case study of the n-queens problem
Rok Sosic,Jun Gu +1 more