Time complexity of the Towers of Hanoi problem


The Towers of Hanoi is a simple puzzle in which N disks of different sizes are placed on one of three towers. The disks are transferred to another of the three towers by moving one disc at a time, with the restriction that no disk may be placed on top of a smaller disk. The puzzle has been used to illustrate recursive programming, divide and conquer problem… (More)
DOI: 10.1145/8312.8320


Cite this paper

@inproceedings{Gerety1986TimeCO, title={Time complexity of the Towers of Hanoi problem}, author={Colin Gerety and P. O. Cull}, booktitle={SIGA}, year={1986} }