{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T09:51:49Z","timestamp":1672307509122},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0020-0190(91)90230-f","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"107-111","source":"Crossref","is-referenced-by-count":6,"title":["The towers of Antwerpen problem"],"prefix":"10.1016","volume":"38","author":[{"given":"Steven","family":"Minsker","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(91)90230-F_BIB1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0020-0190(81)90123-X","article-title":"The cyclic towers of Hanoi","volume":"13","author":"Atkinson","year":"1981","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/0020-0190(91)90230-F_BIB2","first-page":"54","article-title":"Mutants of Hanoi","volume":"1","author":"Celko","year":"1984","journal-title":"ABACUS"},{"issue":"1","key":"10.1016\/0020-0190(91)90230-F_BIB3","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1093\/comjnl\/27.1.80","article-title":"The colour towers of Hanoi: a generalization","volume":"27","author":"Er","year":"1984","journal-title":"Comput. J."},{"issue":"2","key":"10.1016\/0020-0190(91)90230-F_BIB4","first-page":"89","article-title":"The generalized towers of Hanoi problem","volume":"5","author":"Er","year":"1984","journal-title":"J. Inform. Optim. Sci."},{"key":"10.1016\/0020-0190(91)90230-F_BIB5","doi-asserted-by":"crossref","unstructured":"C.S. Klein and S. Minsker, The super towers of Hanoi problem: large rings on small rings, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(93)90373-2"},{"key":"10.1016\/0020-0190(91)90230-F_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(89)90020-5","article-title":"The towers of Hanoi rainbow problem: coloring the rings","volume":"10","author":"Minsker","year":"1989","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/0020-0190(91)90230-F_BIB7","first-page":"17","article-title":"The towers of Brahma and Hanoi revisited","volume":"14","author":"Wood","year":"1981","journal-title":"J. Recreational Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190230F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190230F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:23:51Z","timestamp":1555143831000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190230F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["002001909190230F"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90230-f","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}