{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:06:46Z","timestamp":1759709206986,"version":"build-2065373602"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,1,11]],"date-time":"2022-01-11T00:00:00Z","timestamp":1641859200000},"content-version":"vor","delay-in-days":10,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1815073","CCF-1616248"],"award-info":[{"award-number":["1815073","CCF-1616248"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100003187","name":"NSF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100003187","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1016\/j.tcs.2021.12.002","type":"journal-article","created":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T11:12:43Z","timestamp":1639393963000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Taming the knight's tour: Minimizing turns and crossings"],"prefix":"10.1016","volume":"902","author":[{"given":"Juan Jose","family":"Besa","sequence":"first","affiliation":[]},{"given":"Timothy","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Nil","family":"Mamano","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1077-1074","authenticated-orcid":false,"given":"Martha C.","family":"Osegueda","sequence":"additional","affiliation":[]},{"given":"Parker","family":"Williams","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"2012","series-title":"Across the Board: The Mathematics of Chessboard Problems, Princeton Puzzlers","author":"Watkins","key":"10.1016\/j.tcs.2021.12.002_br0010"},{"year":"1974","series-title":"Mathematical Recreations & Essays","author":"Ball","key":"10.1016\/j.tcs.2021.12.002_br0020"},{"issue":"1","key":"10.1016\/j.tcs.2021.12.002_br0030","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/2945.841119","article-title":"Graph visualization and navigation in information visualization: a survey","volume":"6","author":"Herman","year":"2000","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"10.1016\/j.tcs.2021.12.002_br0040","first-page":"221","article-title":"The angular-metric traveling salesman problem","volume":"vol. 29","author":"Aggarwal","year":"1997"},{"key":"10.1016\/j.tcs.2021.12.002_br0050","doi-asserted-by":"crossref","DOI":"10.1016\/S0020-0190(02)00502-1","article-title":"Minimum-link watchman tours","volume":"86","author":"Arkin","year":"2003","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2021.12.002_br0060","series-title":"Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"138","article-title":"Optimal covering tours with turn costs","author":"Arkin","year":"2001"},{"key":"10.1016\/j.tcs.2021.12.002_br0070","article-title":"Link length of rectilinear hamiltonian tours in grids","volume":"38","author":"Meertens","year":"1994","journal-title":"J. Am. Math. Soc."},{"issue":"6","key":"10.1016\/j.tcs.2021.12.002_br0080","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0020-0190(98)00178-1","article-title":"Improved lower bounds for the link length of rectilinear spanning paths in grids","volume":"68","author":"Collins","year":"1998","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"10.1016\/j.tcs.2021.12.002_br0090","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1080\/0025570X.1991.11977627","article-title":"Which rectangular chessboards have a knight's tour?","volume":"64","author":"Schwenk","year":"1991","journal-title":"Math. Mag."},{"issue":"1","key":"10.1016\/j.tcs.2021.12.002_br0100","doi-asserted-by":"crossref","first-page":"32","DOI":"10.37236\/950","article-title":"Which chessboards have a closed knight's tour within the cube?","volume":"14","author":"DeMaio","year":"2007","journal-title":"Electron. J. Comb."},{"issue":"1","key":"10.1016\/j.tcs.2021.12.002_br0110","first-page":"14","article-title":"Which chessboards have a closed knight's tour within the rectangular prism?","volume":"18","author":"DeMaio","year":"2011","journal-title":"Electron. J. Comb."},{"issue":"4","key":"10.1016\/j.tcs.2021.12.002_br0120","doi-asserted-by":"crossref","first-page":"9","DOI":"10.37236\/2272","article-title":"The closed knight tour problem in higher dimensions","volume":"19","author":"Erde","year":"2012","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.tcs.2021.12.002_br0130","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1080\/00150517.1978.12430328","article-title":"Curtins, knight's tour revisited","volume":"16","author":"Cull","year":"1978","journal-title":"Fibonacci Q."},{"issue":"2","key":"10.1016\/j.tcs.2021.12.002_br0140","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0166-218X(92)00170-Q","article-title":"Solution of the knight's hamiltonian path problem on chessboards","volume":"50","author":"Conrad","year":"1994","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.tcs.2021.12.002_br0150","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0166-218X(96)00031-5","article-title":"Bounds on the number of knight's tours","volume":"74","author":"Kyek","year":"1997","journal-title":"Discrete Appl. Math."},{"year":"1997","series-title":"Knight's tours of an 8 \u00d7 8 chessboard","author":"McKay","key":"10.1016\/j.tcs.2021.12.002_br0160"},{"year":"1993","series-title":"Generating knight's tours without backtracking from errors","author":"Shufelt","key":"10.1016\/j.tcs.2021.12.002_br0170"},{"key":"10.1016\/j.tcs.2021.12.002_br0180","series-title":"Proceedings of the 30th Annual Southeast Regional Conference","first-page":"377","article-title":"Finding re-entrant knight's tours on n-by-m boards","author":"Alwan","year":"1992"},{"issue":"7","key":"10.1016\/j.tcs.2021.12.002_br0190","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1145\/363427.363463","article-title":"A method for finding Hamilton paths and knight's tours","volume":"10","author":"Pohl","year":"1967","journal-title":"Commun. ACM"},{"year":"1996","series-title":"A Warnsdorff-rule algorithm for knight's tours on square chessboards","author":"Squirrel","key":"10.1016\/j.tcs.2021.12.002_br0200"},{"issue":"1","key":"10.1016\/j.tcs.2021.12.002_br0210","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0925-2312(95)00027-5","article-title":"Scalability of a neural network for the knight's tour problem","volume":"12","author":"Parberry","year":"1996","journal-title":"Neurocomputing"},{"issue":"1","key":"10.1016\/j.tcs.2021.12.002_br0220","first-page":"32","article-title":"Generalised knight's tours","volume":"21","author":"Kam\u010dev","year":"2011","journal-title":"Electron. J. Comb."},{"issue":"3","key":"10.1016\/j.tcs.2021.12.002_br0230","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0166-218X(96)00010-8","article-title":"An efficient algorithm for the knight's tour problem","volume":"73","author":"Parberry","year":"1997","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.tcs.2021.12.002_br0240","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.dam.2004.11.002","article-title":"Optimal algorithms for constructing knight's tours on arbitrary n\u00d7m chessboards","volume":"146","author":"Lin","year":"2005","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.tcs.2021.12.002_br0250","doi-asserted-by":"crossref","first-page":"72","DOI":"10.4169\/college.math.j.43.1.072","article-title":"Magic knight's tours","volume":"43","author":"Beasley","year":"2012","journal-title":"Coll. Math. J."},{"issue":"18","key":"10.1016\/j.tcs.2021.12.002_br0260","first-page":"327","article-title":"Three memoirs on knight's tours","volume":"2","author":"Bergholt","year":"2001","journal-title":"Games Puzzles J."},{"key":"10.1016\/j.tcs.2021.12.002_br0270","first-page":"285","article-title":"Equivalent conditions for Euler's problem on z4-Hamilton cycles","author":"Dejter","year":"1983","journal-title":"Ars Comb. 16\u2013B"},{"issue":"16","key":"10.1016\/j.tcs.2021.12.002_br0280","first-page":"282","article-title":"Symmetry in knight's tours","volume":"2","author":"Jelliss","year":"1999","journal-title":"Games Puzzles J."},{"issue":"3","key":"10.1016\/j.tcs.2021.12.002_br0290","first-page":"140","article-title":"Uncrossed knight's tours","volume":"1","author":"Yarbrough","year":"1969","journal-title":"J. Recreat. Math."},{"issue":"17","key":"10.1016\/j.tcs.2021.12.002_br0300","first-page":"305","article-title":"Non-intersecting paths by leapers","volume":"2","author":"Jelliss","year":"1999","journal-title":"Games Puzzles J."},{"key":"10.1016\/j.tcs.2021.12.002_br0310","article-title":"New records in nonintersecting knight paths","author":"Fischer","year":"2006","journal-title":"Games Puzzles J."},{"author":"Kumar","key":"10.1016\/j.tcs.2021.12.002_br0320"},{"issue":"3","key":"10.1016\/j.tcs.2021.12.002_br0330","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/0025570X.1997.11996528","article-title":"Knight's tours on a torus","volume":"70","author":"Watkins","year":"1997","journal-title":"Math. Mag."},{"key":"10.1016\/j.tcs.2021.12.002_br0340","first-page":"232","article-title":"Abelian groups, graphs and generalized knights","volume":"vol. 55","author":"Nash-Williams","year":"1959"},{"issue":"483","key":"10.1016\/j.tcs.2021.12.002_br0350","doi-asserted-by":"crossref","first-page":"274","DOI":"10.2307\/3620202","article-title":"Leaper graphs","volume":"78","author":"Knuth","year":"1994","journal-title":"Math. Gaz."},{"issue":"1","key":"10.1016\/j.tcs.2021.12.002_br0360","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.dam.2004.11.008","article-title":"Generalized knight's tours on rectangular chessboards","volume":"150","author":"Chia","year":"2005","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.tcs.2021.12.002_br0370","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","article-title":"Sparse complete sets for np: solution of a conjecture of Berman and Hartmanis","volume":"25","author":"Mahaney","year":"1982","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2021.12.002_br0380","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","article-title":"A characterization of the minimum cycle mean in a digraph","volume":"23","author":"Karp","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2021.12.002_br0390","article-title":"Knight's tours for cubes and boxes","volume":"01","author":"Qing","year":"2006","journal-title":"Congr. Numer."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397521007052?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397521007052?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:08:49Z","timestamp":1759626529000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397521007052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":39,"alternative-id":["S0304397521007052"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2021.12.002","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2022,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Taming the knight's tour: Minimizing turns and crossings","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2021.12.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}