{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T01:03:51Z","timestamp":1769043831678,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,12,27]],"date-time":"2023-12-27T00:00:00Z","timestamp":1703635200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,27]],"date-time":"2023-12-27T00:00:00Z","timestamp":1703635200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"None"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-023-00284-7","type":"journal-article","created":{"date-parts":[[2023,12,27]],"date-time":"2023-12-27T08:02:00Z","timestamp":1703664120000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Composing the Queen\u2019s Exile \u2014 A Knighted Chain Solution to the N-Queens Problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Abhinav","family":"Swaminathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Swaminathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janardan","family":"Vaidyanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,27]]},"reference":[{"key":"284_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.12.043","author":"J Bell","year":"2009","unstructured":"Bell J, Stevens B (2009) A survey of known results and research areas for N-queens. Discret Math. https:\/\/doi.org\/10.1016\/j.disc.2007.12.043","journal-title":"Discret Math"},{"key":"284_CR2","unstructured":"Hans S (2004)\u00a0Max Friedrich Wilhelm Bezzel. Schachclub-Ansbach.De. http:\/\/www.schachclub-ansbach.de\/chronik_bezzel.htm"},{"issue":"6","key":"284_CR3","doi-asserted-by":"publisher","first-page":"4519","DOI":"10.11591\/ijece.v8i6.pp4519-4523","volume":"8","author":"V Jain","year":"2018","unstructured":"Jain V, Prasad JS (2018) Solving N-queens problem using genetic algorithm by advance mutation operator. Int J Electric Comput Eng (IJECE) 8(6):4519\u20134523","journal-title":"Int J Electric Comput Eng (IJECE)"},{"issue":"4","key":"284_CR4","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/0315-0860(77)90076-3","volume":"4","author":"PJ Campbell","year":"1977","unstructured":"Campbell PJ (1977) Gauss and the eight queens problem: a study in miniature of the propagation of historical error. Hist Math 4(4):397\u2013404","journal-title":"Hist Math"},{"key":"284_CR5","doi-asserted-by":"publisher","unstructured":"Erbas C, Sarkeshik S, Tanik MM (1992) Different perspectives of the N-queens problem. Proceedings of the 1992 ACM Annual Conference on Communications\u00a099\u2013108. https:\/\/doi.org\/10.1145\/131214.131227","DOI":"10.1145\/131214.131227"},{"key":"284_CR6","first-page":"1","volume":"2016","author":"S G\u00fcldal","year":"2016","unstructured":"G\u00fcldal S, Baugh V, Allehaibi S (2016) N-queens solving algorithm by sets and backtracking. SoutheastCon 2016:1\u20138","journal-title":"SoutheastCon"},{"issue":"2","key":"284_CR7","first-page":"62","volume":"6","author":"EV Khanna","year":"2017","unstructured":"Khanna EV, Chopra ES (2017) Review on N-queen optimization using tuned hybrid technique.\u00a0Int J Eng Sci Res Tech (Thomson Reuters) 6(2):62\u201368","journal-title":"Int J Eng Sci Res Tech (Thomson Reuters)"},{"key":"284_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.tcs.2014.05.004","volume":"551","author":"A Maroosi","year":"2014","unstructured":"Maroosi A, Muniyandi RC (2014) Accelerated execution of P systems with active membranes to solve the N-queens problem.\u00a0Theor Comput Sci\u00a0551:39\u201354","journal-title":"Theor Comput Sci"},{"key":"284_CR9","unstructured":"Masehian E, Akbaripour H, Mohabbati-Kalejahi N (2014) Solving the N-queens problem using a tuned hybrid imperialist competitive algorithm. Int Arab J Inform Technol(IAJIT)\u00a011(6)"},{"key":"284_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.22331\/q-2019-06-03-149","volume":"3","author":"V Torggler","year":"2019","unstructured":"Torggler V, Aumann P, Ritsch H, Lechner W (2019) A quantum N-queens solver. Quantum 3:149","journal-title":"Quantum"},{"key":"284_CR11","unstructured":"Ball WWR, Coxeter HSM (1947) Mathematical Recreations and Essays (Eleventh). Dover Publications."},{"key":"284_CR12","first-page":"104","volume":"2","author":"M Bozikovic","year":"2003","unstructured":"Bozikovic M, Golub M, Budin L (2003) Solving N-queens problem using global parallel genetic algorithm. The IEEE Region 8 EUROCON 2003. Computer as a Tool 2:104\u2013107","journal-title":"Computer as a Tool"},{"key":"284_CR13","doi-asserted-by":"publisher","first-page":"6694944","DOI":"10.1155\/2021\/6694944","volume":"2021","author":"J Cao","year":"2021","unstructured":"Cao J, Chen Z, Wang Y, Guo H (2021) Parallel implementations of candidate solution evaluation algorithm for N-queens problem. Complexity 2021:6694944. https:\/\/doi.org\/10.1155\/2021\/6694944","journal-title":"Complexity"},{"issue":"5","key":"284_CR14","doi-asserted-by":"publisher","first-page":"1811","DOI":"10.18517\/ijaseit.11.5.14523","volume":"11","author":"V Kralev","year":"2021","unstructured":"Kralev V, Kraleva R, Chakalov D (2021) Development of an application for interactive research and analysis of the N-queens problem. Int J Adv Sci Eng Inf Technol\u00a011(5):1811\u20131817","journal-title":"Int J Adv Sci Eng Inf Technol"},{"key":"284_CR15","doi-asserted-by":"publisher","unstructured":"Falkowski B-J, Schmitz L (1986) A note on the queen\u2019s problem. Inf Process Lett\u00a023(1):39\u201346. https:\/\/doi.org\/10.1016\/0020-0190(86)90128-6","DOI":"10.1016\/0020-0190(86)90128-6"},{"key":"284_CR16","unstructured":"Sloman L (2021)\u00a0Mathematician Answers Chess Problem About Attacking Queens. Quantamagazine. https:\/\/www.quantamagazine.org\/mathematician-answers-chess-problem-about-attacking-queens-20210921\/"},{"key":"284_CR17","doi-asserted-by":"publisher","DOI":"10.1515\/9781400840922","volume-title":"Across the Board: the Mathematics of Chessboard Problems","author":"JJ Watkins","year":"2004","unstructured":"Watkins JJ (2004) Across the Board: the Mathematics of Chessboard Problems. Princeton University Press"},{"key":"284_CR18","unstructured":"Murali G, Naureen S, Reddy YA, Reddy MS, JNTUA-Pulivendula J-P, JNTUA-Pulivendula J-P (2011) Graphical simulation of N-queens problem.\u00a0Int J Eng Res Technol\u00a02(6)"},{"issue":"3","key":"284_CR19","first-page":"1349","volume":"3","author":"V Kesri","year":"2013","unstructured":"Kesri V, Mishra MK (2013) A new approach to solve N-queens problem based on series. Int J Adv Sci Eng Inf Technol\u00a03(3):1349","journal-title":"Int J Adv Sci Eng Inf Technol"},{"key":"284_CR20","doi-asserted-by":"crossref","unstructured":"Sasaki Y, Fukui M, Hirashima T (2019) Development of iOS software N-queens problem for education and its application for promotion of computational thinking\u00a02019 IEEE 8th Global Conference on Consumer Electronics (GCCE)\u00a0563\u2013565","DOI":"10.1109\/GCCE46687.2019.9015331"},{"key":"284_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.12.013","volume":"736","author":"KC Bu\u00f1o","year":"2018","unstructured":"Bu\u00f1o KC, Cabarle FGC, Calabia MD, Adorna HN (2018) Solving the N-queens problem using dP systems with active membranes.\u00a0Theor Comput Sci\u00a0736:1\u201314","journal-title":"Theor Comput Sci"},{"issue":"9","key":"284_CR22","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1562164.1562186","volume":"52","author":"L Fortnow","year":"2009","unstructured":"Fortnow L (2009) The status of the P versus NP problem. Commun ACM 52(9):78\u201386","journal-title":"Commun ACM"},{"issue":"4","key":"284_CR23","first-page":"3844","volume":"6","author":"VP Lijo","year":"2015","unstructured":"Lijo VP, Jasmin JT (2015) Solving N-queens problem by prediction. Int J Comput Sci Inf Technol 6(4):3844\u20133848","journal-title":"Int J Comput Sci Inf Technol"},{"key":"284_CR24","doi-asserted-by":"crossref","unstructured":"Amooshahi A, Joudaki M, Imani M, Mazhari N (2011) Presenting a new method based on cooperative PSO to solve permutation problems: a case study of N-queens problem 2011 3rd. Int Conf Electr Comput Technol\u00a04:218\u2013222","DOI":"10.1109\/ICECTECH.2011.5941890"},{"key":"284_CR25","doi-asserted-by":"crossref","unstructured":"Habiboghli A, Jalali T (2017)\u00a0A Solution to the N-Queens Problem Using Biogeography-Based Optimization","DOI":"10.9781\/ijimai.2017.443"},{"key":"284_CR26","doi-asserted-by":"crossref","unstructured":"Prudhvi Raj P, Shah P, Suresh P (2019) Faster convergence to N-queens problem using reinforcement learning. International Conference on Modeling, Machine Learning and Astronomy\u00a066\u201377","DOI":"10.1007\/978-981-33-6463-9_6"},{"issue":"1","key":"284_CR27","first-page":"1","volume":"1","author":"B Karabulut","year":"2021","unstructured":"Karabulut B, Erguzen A, Umver HM (2021) A linear time pattern based algorithm for N-queens problem. Politeknik Dergisi 1(1):1","journal-title":"Politeknik Dergisi"},{"issue":"03","key":"284_CR28","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1142\/S0218213005002247","volume":"14","author":"E El-Qawasmeh","year":"2005","unstructured":"El-Qawasmeh E, Al-Noubani K (2005) Reducing the time complexity of the N-queens problem. Int J Artif Intell Tools 14(03):545\u2013557","journal-title":"Int J Artif Intell Tools"},{"issue":"14","key":"284_CR29","first-page":"39","volume":"8","author":"DL Sacaluga","year":"2021","unstructured":"Sacaluga DL (2021) An alternative algorithm for the N-queens puzzle.\u00a0Recreat Math Mag\u00a08(14):39\u201373","journal-title":"Recreat Math Mag"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00284-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-023-00284-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00284-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T06:18:40Z","timestamp":1711433920000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-023-00284-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,27]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,3]]}},"alternative-id":["284"],"URL":"https:\/\/doi.org\/10.1007\/s43069-023-00284-7","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,27]]},"assertion":[{"value":"8 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"3"}}