{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:48Z","timestamp":1759638288683},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2006,7]]},"abstract":"<jats:p>\n            Variants of the classical Tower of Hanoi problem evolved in various directions. Allowing more than 3 pegs, and imposing limitations on the possible moves among the pegs, are two of these. Here, we deal with the case of\n            <jats:italic>h<\/jats:italic>\n            \u22653 pegs arranged on a circle, where moves are allowed only from a peg to the next peg (in the clockwise direction). Unlike the multi-peg problem without restrictions on moves between pegs, the complexity of this variant as a function of the number of disks is exponential. We find explicit lower and upper bounds for its complexity for any\n            <jats:italic>h<\/jats:italic>\n            , and show how this complexity can be estimated arbitrarily well for any specific\n            <jats:italic>h<\/jats:italic>\n            .\n          <\/jats:p>","DOI":"10.1145\/1159892.1159893","type":"journal-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T18:11:32Z","timestamp":1161195092000},"page":"297-317","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["The cyclic multi-peg Tower of Hanoi"],"prefix":"10.1145","volume":"2","author":[{"given":"Daniel","family":"Berend","sequence":"first","affiliation":[{"name":"Ben-Gurion University, Beer-Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Sapir","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Beer-Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1994.11997006"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90123-X"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.12.004"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Berman A. and Plemmons R. J. 1994. \u201cNonnegative Matrices in the Mathematical Sciences \u201d Classics in Applied Mathematics. Vol. 9. SIAM Philadelphia PA.  Berman A. and Plemmons R. J. 1994. \u201cNonnegative Matrices in the Mathematical Sciences \u201d Classics in Applied Mathematics. Vol. 9. SIAM Philadelphia PA.","DOI":"10.1137\/1.9781611971262"},{"key":"e_1_2_1_5_1","first-page":"113","article-title":"Results and open problems on the Tower of Hanoi","volume":"139","author":"Bode J.-P.","year":"1999","journal-title":"Congr. Numer."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703431019"},{"key":"e_1_2_1_7_1","unstructured":"Dudeney H. E. 1908. The Canterbury Puzzles (and Other Curious Problems). E. P. Dutton New York.  Dudeney H. E. 1908. The Canterbury Puzzles (and Other Curious Problems). E. P. Dutton New York."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(87)90020-X"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.2307\/2304268"},{"key":"e_1_2_1_10_1","first-page":"841","article-title":"Generalized Gray codes with applications","volume":"22","author":"Guan D.-J.","year":"1998","journal-title":"Proc. Natl. Sci. Counc. ROC(A)"},{"key":"e_1_2_1_11_1","unstructured":"Hammarling S. J. 1970. Latent Roots and Latent Vectors. Adam Hilger London UK.  Hammarling S. J. 1970. Latent Roots and Latent Vectors. Adam Hilger London UK."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.2307\/2324061"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00287-6"},{"key":"e_1_2_1_14_1","first-page":"81","article-title":"Solving the \u201cTowers of Hanoi\u201d on graphs","volume":"8","author":"Leiss E. L.","year":"1983","journal-title":"J. Combin. Inf. Syst. Sci."},{"key":"e_1_2_1_15_1","unstructured":"Lucas \u00c9. 1893. R\u00e9cr\u00e9ations Math\u00e9matiques. Vol. III. Gauthier-Villars Paris.  Lucas \u00c9. 1893. R\u00e9cr\u00e9ations Math\u00e9matiques. Vol. III. Gauthier-Villars Paris."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90020-5"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"P\u00f3lya G. and Szeg\u0151 G. 1972. Problems and Theorems in Analysis. Vol. I. Springer-Verlag New York.  P\u00f3lya G. and Szeg\u0151 G. 1972. Problems and Theorems in Analysis. Vol. I. Springer-Verlag New York.","DOI":"10.1007\/978-1-4757-1640-5"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/47.1.20"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.2307\/3606393"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.2307\/2302907"},{"key":"e_1_2_1_21_1","first-page":"217","article-title":"Solution to advanced problem 3918","volume":"48","author":"Stewart B. M.","year":"1941","journal-title":"Amer. Math. Monthly"},{"key":"e_1_2_1_22_1","volume-title":"Congr. Numer. 102","author":"Stockmeyer P. K.","year":"1994"},{"key":"e_1_2_1_23_1","volume-title":"Lecture Notes in Computer Science","volume":"1563","author":"Szegedy M.","year":"1999"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1159892.1159893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T20:42:21Z","timestamp":1672260141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1159892.1159893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["10.1145\/1159892.1159893"],"URL":"https:\/\/doi.org\/10.1145\/1159892.1159893","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7]]},"assertion":[{"value":"2006-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}