On the Towers of Hanoi problem

Abstract

We analyze a solution to a variant of the Towers of Hanoi problem, in which multiple spare pegs are used to move the disks from the source to the destination peg. We also discuss the interesting relation between the number of disks and the total number of disk moves when the number of spare pegs is a function of number of disks. 

Topics

Cite this paper

@inproceedings{Veerasamy2007OnTT, title={On the Towers of Hanoi problem}, author={Jeyakesavan Veerasamy}, year={2007} }