Gupta, P. ; Chakrabarti, P. P. ; Ghose, S. (1992) The towers of hanoi: generalizations, specializations and algorithms International Journal of Computer Mathematics, 46 (3-4). pp. 149-161. ISSN 0020-7160
Full text not available from this repository.
Official URL: http://www.informaworld.com/smpp/content~db=all~co...
Related URL: http://dx.doi.org/10.1080/00207169208804147
Abstract
Some variants of the classical problem of Towers of Hanoi incorporating new pragmatic constraints are considered. The classical problem is extended to the multi-peg case. A batched online variant is also proposed. The case wherein not all disks are distinct is also considered. Recursive algorithms for solving variants of the Towers of Hanoi problem incorporating one or more of the above constraints are proposed and their optimality properties are discussed.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Taylor and Francis Ltd. |
| Keywords: | Algorithm Design and Analysis; Combinatorial Algorithms; Towers of Hanoi; Recursive Definition; Dynamic Programming |
| ID Code: | 5959 |
| Deposited On: | 19 Oct 2010 10:03 |
| Last Modified: | 20 May 2011 09:50 |
Repository Staff Only: item control page
