A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem
2007
Annales Universitatis Paedagogicae Cracoviensis: Studia Mathematica
Preserved Fulltext
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.
doaj:0a427182585947b1a36fd6644eb6b1e0
fatcat:lk7uanpvtbcazli7t56dqqtxkq