Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem
There are proved upper explicit estimates of complexity of lgorithms: for multi-peg Tower of Hanoi problem with the limited number of disks, for Reve's puzzle and for $5$-peg Tower of Hanoi problem with the free number of disks.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | deu |
| Published: |
Sciendo
2007-06-01
|
| Series: | Annales Universitatis Paedagogicae Cracoviensis: Studia Mathematica |
| Online Access: | http://studmath.up.krakow.pl/index.php/studmath/article/view/58 |