Complexity of n-Queens Completion
- Submitting institution
-
University of St Andrews
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 252064498
- Type
- D - Journal article
- DOI
-
10.1613/jair.5512
- Title of journal
- Journal of Artificial Intelligence Research
- Article number
- -
- First page
- 815
- Volume
- 59
- Issue
- -
- ISSN
- 1076-9757
- Open access status
- Compliant
- Month of publication
- August
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
A - Artificial Intelligence
- Citation count
- 12
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper resolved an important question about a problem first studied originated in 1850, of placing n queens on an n by n chessboard on which some queens have already been placed. This paper was widely covered in the media, including The Daily Mail and The Scotsman, leading to hundreds of enquiries to the authors from members of the public. It has led to a resurgence in interest in both the theory and practical solving of the n-queens problem, for example a quantum-based solver for the problem used our benchmarks as their test cases.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
