IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v5y2024i1d10.1007_s43069-023-00284-7.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Abhinav Swaminathan & Abhishek Swaminathan & Janardan Vaidyanathan, 2024. "Composing the Queen’s Exile — A Knighted Chain Solution to the N-Queens Problem," SN Operations Research Forum, Springer, vol. 5(1), pages 1-21, March.
    • Handle: RePEc:spr:snopef:v:5:y:2024:i:1:d:10.1007_s43069-023-00284-7
    DOI: 10.1007/s43069-023-00284-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-023-00284-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s43069-023-00284-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:snopef:v:5:y:2024:i:1:d:10.1007_s43069-023-00284-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.