Complexity of n-Queens Completion

Gent, Ian Philip, Jefferson, Christopher Anthony and Nightingale, Peter William (2017) Complexity of n-Queens Completion. Journal of Artificial Intelligence Research (JAIR). pp. 815-848. ISSN 1076-9757



Copyright, Publisher and Additional Information: © 2017, AI Access Foundation. This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details.
Keywords: Constraint satisfaction problem, Constraint programming, Formal methods
  • Accepted: 8 August 2017
  • Published: 30 August 2017
Institution: The University of York
Academic Units: The University of York > Faculty of Sciences (York) > Computer Science (York)
Depositing User: Pure (York)
Date Deposited: 24 Jan 2019 10:30
Last Modified: 07 Dec 2022 13:05
Published Version:
Status: Published
Refereed: Yes
Identification Number:
Related URLs:


Filename: n_queens_jair.pdf

Description: n-queens-jair

Share / Export