The density function of the number of moves to complete the Towers of Hanoi puzzle |
| |
| Authors: | F Scarioni M G Speranza |
| |
| Institution: | (1) Department of Mathematics, University of Milano, via Cicognara 7, I-20129 Milano, Italy |
| |
| Abstract: | Any sequence of legal moves leads the Towers of Hanoi puzzle to an arrangement from which the final configuration must be built up. A recursive algorithm which finishes off the puzzle is considered and, assuming a uniform distribution on the possible unfinished situations, the density function of the number of moves it takes is derived. |
| |
| Keywords: | Towers of Hanoi error-correcting algorithm probabilistic analysis discrete density function recurrence equations |
| 本文献已被 SpringerLink 等数据库收录！ |
