{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T14:49:56Z","timestamp":1775227796317,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":5982,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0166-218x(96)00010-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"251-260","source":"Crossref","is-referenced-by-count":30,"title":["An efficient algorithm for the Knight's tour problem"],"prefix":"10.1016","volume":"73","author":[{"given":"Ian","family":"Parberry","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00010-8_BIB1","series-title":"Mathematical Recreations and Essays","author":"Ball","year":"1974"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB2","series-title":"The rec. puzzles Frequently Asked Questions List, Version 4, available by anonymous ftp from rtfm.mit.edu in \/pub\/usenet\/news.answers\/puzzles\/archive","author":"Cole","year":"1993"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB3","first-page":"10","article-title":"Wie es dem springer gelang, Schachbretter beliebiger groesse und zwischen beliebig vorgegebenen anfangs- und endfeldern vollstaendig abzuschreiten, Spektrum der Wissenschaft","author":"Conrad","year":"1992"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB4","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 App. Math."},{"key":"10.1016\/S0166-218X(96)00010-8_BIB5","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1080\/00150517.1978.12430328","article-title":"Knight's tour revisited","volume":"16","author":"Cull","year":"1978","journal-title":"Fibonacci Quart."},{"key":"10.1016\/S0166-218X(96)00010-8_BIB6","first-page":"285","article-title":"Equivalent conditions for Euler's problem on Z4-Hamilton cycles","volume":"16","author":"Dejter","year":"1983","journal-title":"Ars Combin."},{"key":"10.1016\/S0166-218X(96)00010-8_BIB7","series-title":"Mathematical Games and Pastimes","author":"Domoryad","year":"1964"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB8","series-title":"Amusements in Mathematics","author":"Dudeney","year":"1917"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB9","series-title":"Amusements in Mathematics","author":"Dudeney","year":"1970"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB10","first-page":"310","article-title":"Solution d'une question curieuse qui ne paroit soumise \u00e0 aucune analyse","author":"Euler","year":"1959"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB11","series-title":"Mathematical Magic Show","author":"Gardner","year":"1977"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2307\/2690960","article-title":"The knight's tour on the 15-puzzle","volume":"66","author":"P Hurd","year":"1993","journal-title":"Math. Mag."},{"key":"10.1016\/S0166-218X(96)00010-8_BIB13","series-title":"Algorithms and Complexity","article-title":"Parallel algorithms for shared-memory machines","volume":"vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB14","series-title":"Bounds on the number of knight's tours","author":"Kyek","year":"1994"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB15","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays. Trees. Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB16","article-title":"Parallel Complexity Theory","author":"Parberry","year":"1987"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB17","article-title":"Algorithms for touring knights","author":"Parberry","year":"1994"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB18","doi-asserted-by":"crossref","unstructured":"I. Parberry, Scalability of a neural network for the knight's tour problem, Neurocomputing, to appear.","DOI":"10.1016\/0925-2312(95)00027-5"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB19","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."},{"key":"10.1016\/S0166-218X(96)00010-8_BIB20","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1109\/TC.1983.1676331","article-title":"Mesh-connected computers with broadcasting","volume":"C-32","author":"Stout","year":"1983","journal-title":"IEEE Tran. Comput."},{"key":"10.1016\/S0166-218X(96)00010-8_BIB21","series-title":"27th Annual Symp. on Foundations of Computer Science","first-page":"264","article-title":"Meshes with multiple buses","author":"Stout","year":"1986"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB22","series-title":"Neural Network Parallel Computing","author":"Takefuji","year":"1992"},{"key":"10.1016\/S0166-218X(96)00010-8_BIB23","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0925-2312(92)90030-S","article-title":"Neural network computing for knight's tour problems","volume":"4","author":"Takefuji","year":"1992","journal-title":"Neurocomputing"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000108?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000108?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T19:53:13Z","timestamp":1733341993000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0166218X96000108"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00010-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}