Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem
xmlui.dri2xhtml.METS-1.0.item-citation: Annales Academiae Paedagogicae Cracoviensis. 45, Studia Mathematica 6 (2007), s. [57]-66
xmlui.dri2xhtml.METS-1.0.item-iso: en
Date: 2007
Metadata
Show full item recordAbstract
There are proved upper explicit estimates of complexity of algorithms: 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.