Browsing 2007, Studia Mathematica 6 by Title

Now showing items 13-13 of 13

Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem

Novikov, Sergey (2007)

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.