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.