Abstract
In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a (Formula Presented) lower bound on the number of steps necessary for transferring n disks from one peg to.
Cite
CITATION STYLE
APA
Szegedy, M. (1999). In how many steps the k peg version of the towers of hanoi game can be solved. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1563, pp. 356–361). Springer Verlag. https://doi.org/10.1007/3-540-49116-3_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free