Skip to content

Research at St Andrews

Complexity of n-Queens Completion (Extended Abstract)

Research output: ResearchConference contribution

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.
Close

Details

Original languageEnglish
Title of host publicationProceedings of the 27th International Joint Conference on Artificial Intelligence
Number of pages4
StateAccepted/In press - 21 May 2018
Event27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence - Stockholmsmässan, Älvsjö , Stockholm, Sweden
Duration: 13 Jul 201819 Jul 2018
Conference number: 27/23
https://www.ijcai-18.org/

Conference

Conference27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence
Abbreviated titleIJCAI-ECAI-18
CountrySweden
CityStockholm
Period13/07/1819/07/18
Internet address

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Automatically improving constraint models in Savile Row

    Nightingale, P., Akgün, Ö., Gent, I. P., Jefferson, C., Miguel, I. & Spracklen, P. Oct 2017 In : Artificial Intelligence. 251, p. 35-61 27 p.

    Research output: Research - peer-reviewArticle

  2. Complexity of n-Queens Completion

    Gent, I. P., Jefferson, C. A. & Nightingale, P. W. Aug 2017 In : Journal of Artificial Intelligence Research. 59, p. 815-848 34 p.

    Research output: Research - peer-reviewArticle

  3. Exploiting short supports for improved encoding of arbitrary constraints into SAT

    Akgün, Ö., Gent, I. P., Jefferson, C. A., Miguel, I. J. & Nightingale, P. W. 2016 Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings. Rueher, M. (ed.). Springer, p. 3-12 (Lecture Notes in Computer Science; vol. 9892)

    Research output: ResearchConference contribution

  4. Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression Elimination

    Nightingale, P., Akgun, O., Gent, I. P., Jefferson, C. & Miguel, I. Sep 2014 Principles and Practice of Constraint Programming. OSullivan, B. (ed.). Cham: Springer, p. 590-605 16 p. (Lecture Notes in Computer Science; vol. 8656)

    Research output: ResearchConference contribution

  5. Generating custom propagators for arbitrary constraints

    Gent, I. P., Jefferson, C., Linton, S., Miguel, I. & Nightingale, P. 1 Jun 2014 In : Artificial Intelligence. 211, 1, p. 1-33 33 p.

    Research output: Research - peer-reviewArticle

ID: 253147871