Simple Variations on The Tower of Hanoi

A tétel rövid nézete
dc.contributor.authorMneimneh, Saad
dc.date.accessioned2024-07-30T13:17:56Z
dc.date.available2024-07-30T13:17:56Z
dc.date.issued2020-03-24
dc.description.abstractThe Tower of Hanoi problem was formulated in 1883 by mathematician Edouard Lucas. For over a century, this problem has become familiar to many of us in disciplines such as computer programming, algorithms, and discrete mathematics. Several variations to Lucas' original problem exist today, and interestingly some remain unsolved and continue to ignite research questions. Nevertheless, simple variations can still lead to interesting recurrences, which in turn are associated with exemplary proofs by induction. We explore this richness of the Tower of Hanoi beyond its classical setting to compliment the study of recurrences and proofs by induction, and clarify their pitfalls. Both topics are essential components of any typical introduction to algorithms or discrete mathematics. Subject Classification: A20, C30, D40, D50, E50, M10, N70, P20, Q30, R20en
dc.formatapplication/pdf
dc.identifier.citationTeaching Mathematics and Computer Science, Vol. 17 No. 2 (2019) , 131-158
dc.identifier.doihttps://doi.org/10.5485/TMCS.2019.0459
dc.identifier.eissn2676-8364
dc.identifier.issn1589-7389
dc.identifier.issue2
dc.identifier.jatitleTeach. Math. Comp. Sci.
dc.identifier.jtitleTeaching Mathematics and Computer Science
dc.identifier.urihttps://hdl.handle.net/2437/378496
dc.identifier.volume17
dc.languageen
dc.relationhttps://ojs.lib.unideb.hu/tmcs/article/view/10953
dc.rights.accessOpen Access
dc.rights.ownerSaad Mneimneh
dc.subjectTower of Hanoien
dc.subjectRecurrencesen
dc.subjectProofs by Inductionen
dc.titleSimple Variations on The Tower of Hanoien
dc.typefolyóiratcikkhu
dc.typearticleen
Fájlok
Eredeti köteg (ORIGINAL bundle)
Megjelenítve 1 - 1 (Összesen 1)
Nem elérhető
Név:
PDF
Méret:
497.74 KB
Formátum:
Adobe Portable Document Format
Letöltés
Gyűjtemények
Teaching Mathematics and Computer Science (DE-journals)