{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:01:37Z","timestamp":1649199697481},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6894,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0304-3975(94)90239-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"347-375","source":"Crossref","is-referenced-by-count":3,"title":["Generating Hamiltonian circuits without backtracking from errors"],"prefix":"10.1016","volume":"132","author":[{"given":"Jefferey A.","family":"Shufelt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans J.","family":"Berliner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90239-9_bib1","series-title":"Tech. Report CMU-CS-92-211","article-title":"Pattern recognition interacting with search","author":"Berliner","year":"1992"},{"key":"10.1016\/0304-3975(94)90239-9_bib2","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."},{"key":"10.1016\/0304-3975(94)90239-9_bib3","first-page":"310","author":"Euler","year":"1766","journal-title":"M\u00e9moires de Berlin for 1759"},{"key":"10.1016\/0304-3975(94)90239-9_bib4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(94)90239-9_bib5","first-page":"301","article-title":"A problem similarity approach to devising heuristics: first results","author":"Gaschnig","year":"1979","journal-title":"Proc. of the 6th Internat. Joint Conf. on Artificial Intelligence"},{"key":"10.1016\/0304-3975(94)90239-9_bib6","unstructured":"C.F. de Jaenisch, Applications de l'Analyse Math\u00e9matique au Jeu des\u00c9checs, Vol. 2, p. 268, 1862-3, Petrograd."},{"issue":"4","key":"10.1016\/0304-3975(94)90239-9_bib7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(90)90156-R","article-title":"An almost perfect heuristic for the N nonattacking queens problem","volume":"34","author":"Kale","year":"1990","journal-title":"Inform. Process. Lett."},{"issue":"129","key":"10.1016\/0304-3975(94)90239-9_bib8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.2307\/2005469","article-title":"Estimating the efficiency of backtrack programs","volume":"29","author":"Knuth","year":"1975","journal-title":"Math. Comp."},{"key":"10.1016\/0304-3975(94)90239-9_bib9","author":"Korf","year":"1993","journal-title":"personal communication"},{"key":"10.1016\/0304-3975(94)90239-9_SB0045","first-page":"360","author":"Kra\u00eftchik","year":"1930","journal-title":"La Mathematique des Jeux"},{"key":"10.1016\/0304-3975(94)90239-9_SB0050","first-page":"402","author":"Kra\u00eftchik","year":"1930","journal-title":"La Mathematique des Jeux"},{"issue":"5","key":"10.1016\/0304-3975(94)90239-9_bib11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0020-0190(92)90168-U","article-title":"A dynamic programming solution to the n-queens problem","volume":"41","author":"Rivin","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90239-9_bib12","series-title":"Mathematical Recreations and Essays","author":"Rouse Ball","year":"1962"},{"issue":"5","key":"10.1016\/0304-3975(94)90239-9_bib13","doi-asserted-by":"crossref","first-page":"325","DOI":"10.2307\/2690649","article-title":"Which rectangular chessboards have a knight's tour?","volume":"64","author":"Schwenk","year":"1991","journal-title":"Math. Mag."},{"issue":"4","key":"10.1016\/0304-3975(94)90239-9_bib14","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1147\/rd.314.0464","article-title":"Efficient search techniques \u2014 An empirical study of the N-queens problem","volume":"31","author":"Stone","year":"1987","journal-title":"IBM J. Res. and Dev."},{"issue":"5","key":"10.1016\/0304-3975(94)90239-9_bib15","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0925-2312(92)90030-S","article-title":"Neutral network computing for knight's tour problems","volume":"4","author":"Takefuji","year":"1992","journal-title":"Neurocomputing (Netherlands)"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902399?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902399?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:41Z","timestamp":1555129721000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594902399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0304397594902399"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90239-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}