{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T05:21:29Z","timestamp":1672377689171},"reference-count":1,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCSE Bull."],"published-print":{"date-parts":[[2008,11,30]]},"abstract":"\n We propose another simple Towers of Hanoi variant, a hybrid between classical Hanoi and linear Hanoi, in which the rules governing movement depend on ring color. An optimal algorithm is presented. The problem and its heavily recursive solution are\n not<\/jats:italic>\n difficult; perhaps one of its more interesting facets is that the optimality proof uses simultaneous induction on\n four<\/jats:italic>\n statements. This paper can be viewed as similar in purpose and spirit to the author's previous work [1]; the goal here is again to present a fun example of potential usefulness in teaching discrete mathematics and data structures courses.\n <\/jats:p>","DOI":"10.1145\/1473195.1473215","type":"journal-article","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T15:32:31Z","timestamp":1228923151000},"page":"35-37","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Another brief recursion excursion to Hanoi"],"prefix":"10.1145","volume":"40","author":[{"given":"Steven","family":"Minsker","sequence":"first","affiliation":[{"name":"University of Arkansas at Little Rock, Little Rock, Arkansas"}]}],"member":"320","published-online":{"date-parts":[[2008,11,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345375.1345410"}],"container-title":["ACM SIGCSE Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1473195.1473215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T09:11:11Z","timestamp":1672305071000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1473195.1473215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,30]]},"references-count":1,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,11,30]]}},"alternative-id":["10.1145\/1473195.1473215"],"URL":"https:\/\/doi.org\/10.1145\/1473195.1473215","relation":{},"ISSN":["0097-8418"],"issn-type":[{"value":"0097-8418","type":"print"}],"subject":[],"published":{"date-parts":[[2008,11,30]]},"assertion":[{"value":"2008-11-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}