{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T04:47:44Z","timestamp":1774932464447,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:00:00Z","timestamp":1774915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:00:00Z","timestamp":1774915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007082","name":"Universidade Federal De Santa Catarina","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007082","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Magic squares are a fascinating mathematical challenge that has intrigued mathematicians for centuries. Given a positive (and possibly large) integer\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$ n $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>n<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , one of the main challenges that still remains is to find, within a reasonable computational time, a magic square of order\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$ n $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>n<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , that is, a square matrix of order\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$ n $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>n<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    with unique integers from\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$ a_{\\min } $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>a<\/mml:mi>\n                            <mml:mo>min<\/mml:mo>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    to\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$ a_{\\max } $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>a<\/mml:mi>\n                            <mml:mo>max<\/mml:mo>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , such that the sum of each row, column, and diagonal equals a constant\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$ \\mathcal {C}(A) $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>C<\/mml:mi>\n                            <mml:mo>(<\/mml:mo>\n                            <mml:mi>A<\/mml:mi>\n                            <mml:mo>)<\/mml:mo>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . In this work, we first present an integer constraint satisfaction problem for constructing a magic square of order\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$ n $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>n<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . Nonetheless, the solution time of this problem grows exponentially as the order increases. To overcome this limitation, we also propose a fast approach that constructs magic squares depending on whether\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$ n $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>n<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    is odd, singly even, or doubly even. Moreover, we provide a proof of the correctness of this novel approach. Our numerical results show that our method can construct magic squares of order up to 70\u00a0000 in less than 140 seconds, demonstrating its efficiency and scalability.\n                  <\/jats:p>","DOI":"10.1007\/s40314-026-03731-3","type":"journal-article","created":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T03:14:20Z","timestamp":1774926860000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constructing magic squares: an integer constraint satisfaction problem and a fast approach"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-5862-3465","authenticated-orcid":false,"given":"Jo\u00e3o Vitor","family":"Pamplona","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4045-0597","authenticated-orcid":false,"given":"Maria Eduarda","family":"Pinheiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0083-5871","authenticated-orcid":false,"given":"Luiz-Rafael","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,31]]},"reference":[{"issue":"1","key":"3731_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10601-012-9128-9","volume":"18","author":"C Ans\u00f3tegui","year":"2013","unstructured":"Ans\u00f3tegui C, B\u00e9jar R, Fern\u00e1ndez C, Mateu C (2013) On the hardness of solving edge matching puzzles as SAT or CSP problems. Constraints 18(1):7\u201337","journal-title":"Constraints"},{"key":"3731_CR2","unstructured":"Ball WWR, Coxeter HSM (1987) Mathematical Recreations and Essays. Dover Publications, 13th edition. See Chapter on Magic Squares"},{"key":"3731_CR3","unstructured":"Berthelot M, Ruelle CE (1888) Collection des anciens alchimistes grecs. Number v. 4 in Collection des anciens alchimistes grecs. G. Steinheil. URL https:\/\/books.google.com.br\/books?id=4leHFGQrVsgC"},{"issue":"1","key":"3731_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson J, Edelman A, Karpinski S, Shah VB (2017) Julia: a fresh approach to numerical computing. SIAM Rev 59(1):65\u201398. https:\/\/doi.org\/10.1137\/141000671","journal-title":"SIAM Rev"},{"key":"3731_CR5","unstructured":"Chen J, Revels J (2016) Robust benchmarking in noisy environments"},{"key":"3731_CR6","doi-asserted-by":"publisher","unstructured":"Crawford B, Aranda M, Castro C, Monfroy E (2008) Using constraint programming to solve sudoku puzzles. In 2008 Third International Conference on Convergence and Hybrid Information Technology, volume\u00a02, pages 926\u2013931. https:\/\/doi.org\/10.1109\/ICCIT.2008.154","DOI":"10.1109\/ICCIT.2008.154"},{"key":"3731_CR7","unstructured":"Crawford B, Castro C, Monfroy E, Rodr\u00edguez N (2009) Solving constraint satisfaction puzzles with constraint programming. URL https:\/\/www.palermo.edu\/ingenieria\/Cica2009\/Papers\/64.pdf"},{"key":"3731_CR8","doi-asserted-by":"publisher","unstructured":"Cruz EF, Grandchamp E (2012) Heuristic Method to Find Magic Squares. In 2012 IEEE 15th International Conference on Computational Science and Engineering, pages 119\u2013123. IEEE. ISBN 978-1-4673-5165-2 978-0-7695-4914-9. https:\/\/doi.org\/10.1109\/ICCSE.2012.26","DOI":"10.1109\/ICCSE.2012.26"},{"key":"3731_CR9","unstructured":"De\u00a0la Loub\u00e8re S (1691) A New Historical Relation of the Kingdom of Siam, volume\u00a02. T. Horne, London, 1693. Translated from the French original \"Du Royaume de Siam\". Contains \"The Problem of the Magical Squares according to the Indians\""},{"key":"3731_CR10","doi-asserted-by":"publisher","unstructured":"Van\u00a0Den Essen A (1990) Magic Squares and Linear Algebra. The American Mathematical Monthly, 97(1):60. ISSN 00029890. https:\/\/doi.org\/10.2307\/2324009","DOI":"10.2307\/2324009"},{"key":"3731_CR11","doi-asserted-by":"publisher","unstructured":"Fahimi P A simple analysis of difference between two subjects in $$3 \\times 3$$ matrices: center of mass and magic squares. In Proceeding of Annual Physics Conference of Iran, pages 3328\u20133331. https:\/\/doi.org\/10.13140\/2.1.4492.6723","DOI":"10.13140\/2.1.4492.6723"},{"key":"3731_CR12","unstructured":"Fahimi P, Javadi R (2016) An introduction to magic squares and their physical applications"},{"key":"3731_CR13","doi-asserted-by":"publisher","unstructured":"Forrest J, Lougee-Heimer R (2005) CBC User Guide. In Harvey\u00a0J. Greenberg and J.\u00a0Cole Smith, editors, Emerging Theory, Methods, and Applications, pages 257\u2013277. INFORMS. ISBN 978-1-877640-21-6. https:\/\/doi.org\/10.1287\/educ.1053.0020","DOI":"10.1287\/educ.1053.0020"},{"key":"3731_CR14","unstructured":"Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual, 2024. URL https:\/\/www.gurobi.com"},{"issue":"2","key":"3731_CR15","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1006\/jabr.2000.8697","volume":"239","author":"JM Landsberg","year":"2001","unstructured":"Landsberg JM, Manivel L (2001) The projective geometry of Freudenthal\u2019s magic square. J Algebra 239(2):477\u2013512","journal-title":"J Algebra"},{"key":"3731_CR16","volume-title":"Linear Algebra of Magic Squares","author":"M Lee","year":"2006","unstructured":"Lee M, Love E, Wascher E (2006) Linear Algebra of Magic Squares. Central Michigan University, Mount Pleasant, MI, Undergraduate Research"},{"key":"3731_CR17","doi-asserted-by":"publisher","unstructured":"Liu C, Zhao T, Lu B (2015) An Efficient Algorithm for Constructing all Magic Squares of Order Four. International Journal of Control and Automation, 8(11):235\u2013244. ISSN 20054297, 20054297. https:\/\/doi.org\/10.14257\/ijca.2015.8.11.23","DOI":"10.14257\/ijca.2015.8.11.23"},{"issue":"10","key":"3731_CR18","doi-asserted-by":"publisher","first-page":"2659","DOI":"10.1016\/j.laa.2008.10.032","volume":"430","author":"P Loly","year":"2009","unstructured":"Loly P, Cameron I, Trump W, Schindel D (2009) Magic square spectra. Linear Algebra Appl 430(10):2659\u20132680","journal-title":"Linear Algebra Appl"},{"key":"3731_CR19","unstructured":"O\u2019Sullivan B, Horan J (2007) Generating and solving logic puzzles through constraint satisfaction. In Proceedings of the 22nd National Conference on Artificial Intelligence - Volume 2, AAAI\u201907, page 1974\u20131975. AAAI Press. ISBN 9781577353232"},{"key":"3731_CR20","doi-asserted-by":"publisher","unstructured":"Takemi K, Sakuma T, Kato S (2023) Speed-Up Method for Magic Square Generation Using Multi-Stage Evolutionary Strategy Cascaded by Satisfiable Individuals for Magic Sum. In 2023 IEEE 12th Global Conference on Consumer Electronics (GCCE), pages 549\u2013550. https:\/\/doi.org\/10.1109\/GCCE59613.2023.10315664","DOI":"10.1109\/GCCE59613.2023.10315664"},{"key":"3731_CR21","doi-asserted-by":"publisher","unstructured":"Takemi K, Sakuma T, Kato S (2024) Large size magic square generation using multi-stage evolutionary strategy. In 2024 IEEE International Conference on Agents (ICA), pages 114\u2013119, Wollongong, Australia. IEEE. ISBN 979-8-3315-3991-7. https:\/\/doi.org\/10.1109\/ICA63002.2024.00032","DOI":"10.1109\/ICA63002.2024.00032"},{"key":"3731_CR22","unstructured":"von Nettesheim HCA (1531) De Occulta Philosophia. Beringi. URL https:\/\/books.google.com.br\/books?id=bRg8AAAAcAAJ"},{"issue":"02","key":"3731_CR23","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1112\/S0024610706022605","volume":"73","author":"BW Westbury","year":"2006","unstructured":"Westbury BW (2006) Sextonions and the magic square. J Lond Math Soc 73(02):455\u2013474","journal-title":"J Lond Math Soc"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03731-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-026-03731-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03731-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T03:14:29Z","timestamp":1774926869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-026-03731-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,31]]},"references-count":23,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["3731"],"URL":"https:\/\/doi.org\/10.1007\/s40314-026-03731-3","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,31]]},"assertion":[{"value":"12 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"332"}}