{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T09:11:35Z","timestamp":1672305095333},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s00373-007-0705-4","type":"journal-article","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T11:26:17Z","timestamp":1183375577000},"page":"153-167","source":"Crossref","is-referenced-by-count":3,"title":["Santa Claus\u2019 Towers of Hanoi"],"prefix":"10.1007","volume":"23","author":[{"given":"Xiaomin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Bin","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"705_CR1","unstructured":"Atkinson, M. D.: The cyclic towers of Hanoi. Inf. Process. Lett. 13(3), 118\u2013119 (1981)"},{"key":"705_CR2","doi-asserted-by":"crossref","unstructured":"Chen, X., Shen, J., On the Frame\u2013Stewart conjecture about the Towers of Hanoi. SIAM J. Comput. 33(3), 584\u2013589 (2004)","DOI":"10.1137\/S0097539703431019"},{"key":"705_CR3","unstructured":"Claus, N., (= Lucas, E.): La Tour d Hanoi. Jeu de calcul. Sci. Nat. 1(8), 127\u2013128 (1884)"},{"key":"705_CR4","doi-asserted-by":"crossref","unstructured":"Dinitz, Y., Solomon, S.: Optimality of an algorithm solving the Bottleneck tower of Hanoi problem, a manucript, 2006","DOI":"10.1007\/978-3-540-69507-3_20"},{"key":"705_CR5","unstructured":"Frame, J. S.: Solution to advanced problem 3918. Am. Math. Mon. 48, 216\u2013217 (1941)"},{"key":"705_CR6","doi-asserted-by":"crossref","unstructured":"Klav\u017ear, S., Milutinovi\u0107, U., Petr, C.: On the Frame\u2013Stewart algorithm for the multi-peg Tower of Hanoi problem. Discrete Appl. Math. 120(1\u20133), 141\u2013157 (2002)","DOI":"10.1016\/S0166-218X(01)00287-6"},{"key":"705_CR7","doi-asserted-by":"crossref","unstructured":"Klein, C. S., Minsker, S.: The super Towers of Hanoi problem: large rings on small rings. Discrete Math. 114(1\u20133), 283\u2013295 (1993)","DOI":"10.1016\/0012-365X(93)90373-2"},{"key":"705_CR8","unstructured":"Poole, D.: The Bottleneck Towers of Hanoi problem. J. Recreat. Math. 24(3), 203\u2013207 (1992)"},{"key":"705_CR9","doi-asserted-by":"crossref","unstructured":"Stewart, B. M.: Advanced problem 3918. Am. Math. Mon. 46, 363 (1939)","DOI":"10.2307\/2302907"},{"key":"705_CR10","unstructured":"Stewart, B. M.: Solution to advanced problem 3918. Am. Math. Mon. 48, 217\u2013219 (1941)"},{"key":"705_CR11","unstructured":"Stockmeyer, P. K.: The Tower of Hanoi: A Historical Survey and Bibliography, manuscript available at http:\/\/www.cs.wm.edu\/~pkstoc\/biblio.ps, 2001"},{"key":"705_CR12","doi-asserted-by":"crossref","unstructured":"Szegedy, M.: In how many steps the k peg version of the Towers of Hanoi game can be solved? STACS 99 (Trier), pp. 356\u2013361, Lecture Notes in Computer Science vol. 1563. Springer, Berlin, 1999","DOI":"10.1007\/3-540-49116-3_33"},{"key":"705_CR13","unstructured":"Wood, D.: Towers of Brahma and Hanoi Revisited. J. Recreat. Math. 14, 17\u201324 (1981)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0705-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0705-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0705-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:27Z","timestamp":1559055507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0705-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":13,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["705"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0705-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6]]}}}