Complexity of n-Queens Completion

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

Abstract

Metadata

Authors/Creators:
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,Artificial Intelligence
Dates:
  • 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: 12 Sep 2021 10:16
Published Version: https://doi.org/10.1613/jair.5512
Status: Published
Refereed: Yes
Identification Number: https://doi.org/10.1613/jair.5512
Related URLs:

Download

Filename: n_queens_jair.pdf

Description: n-queens-jair

Share / Export

Statistics