Author:
Gent Ian P.,Jefferson Christopher,Nightingale Peter
Abstract
The n-Queens problem is to place n chess queens on an n by n chessboard so that no two queens are on the same row, column or diagonal. The n-Queens Completion problem is a variant, dating to 1850, in which some queens are already placed and the solver is asked to place the rest, if possible. We show that n-Queens Completion is both NP-Complete and #P-Complete. A corollary is that any non-attacking arrangement of queens can be included as a part of a solution to a larger n-Queens problem. We introduce generators of random instances for n-Queens Completion and the closely related Blocked n-Queens and Excluded Diagonals Problem. We describe three solvers for these problems, and empirically analyse the hardness of randomly generated instances. For Blocked n-Queens and the Excluded Diagonals Problem, we show the existence of a phase transition associated with hard instances as has been seen in other NP-Complete problems, but a natural generator for n-Queens Completion did not generate consistently hard instances. The significance of this work is that 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. Our results give alternative benchmarks which are hard theoretically and empirically, but for which solving techniques designed for n-Queens need minimal or no change.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Efficient Constraint Learning For Stream Reasoning;2023 IEEE 35th International Conference on Tools with Artificial Intelligence (ICTAI);2023-11-06
2. On the behavior of parallel island models;Applied Soft Computing;2023-11
3. Quantum Metropolis Solver: a quantum walks approach to optimization problems;Quantum Machine Intelligence;2023-07-17
4. Generating Presence-Absence Matrices by Quantum Annealing;2023 IEEE/ACM 4th International Workshop on Quantum Software Engineering (Q-SE);2023-05
5. An incremental approach to the n-queen problem with polynomial time;Journal of King Saud University - Computer and Information Sciences;2023-03