Composing the Queen’s Exile — A Knighted Chain Solution to the N-Queens Problem

Abhinav Swaminathan, Abhishek Swaminathan and Janardan Vaidyanathan ()
Additional contact information
Abhinav Swaminathan: Vivekanand Education Society’s Institute of Technology
Abhishek Swaminathan: Sardar Patel Institute of Technology
Janardan Vaidyanathan: National Institute of Industrial Engineering, Maharashtra State

SN Operations Research Forum, 2024, vol. 5, issue 1, 1-21

Abstract: Abstract The N-queens problem plays an important role in academic research and has many practical applications ranging from physics to biology and cryptography to protein folding. The complexity increases with increasing values of n. Solving for the location of queens arranged as knighted chains can reduce the time complexity and resource requirements, providing at least one fundamental solution for all n (n ≥ 4). An exhaustive memoir on the development of a heuristic algorithm to propose a plausible solution for the N-queens problem is presented. Every n is mapped into an instance of its even analogue, assigned to groups, and a solution is designed with knighted chain patterns. In case of odd n, the solution is extended to complete the composition. Furthermore, a generalised solution for all n (n ≥ 4) is presented. Composing the queen’s exile by knighted chains results in a symmetric solution that could both be solvable and verifiable.

Keywords: Complexity theory; N-queen mosaic pattern; N-queen solution heuristics; Solvability; Verifiability (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s43069-023-00284-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:snopef:v:5:y:2024:i:1:d:10.1007_s43069-023-00284-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069

DOI: 10.1007/s43069-023-00284-7

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().