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 |
| _version_ | 1811312749089652736 |
|---|---|
| author | Sergey Novikov |
| author_facet | Sergey Novikov |
| author_sort | Sergey Novikov |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-13T10:42:05Z |
| format | Article |
| id | doaj.art-0a427182585947b1a36fd6644eb6b1e0 |
| institution | Directory Open Access Journal |
| issn | 2081-545X |
| language | deu |
| last_indexed | 2024-04-13T10:42:05Z |
| publishDate | 2007-06-01 |
| publisher | Sciendo |
| record_format | Article |
| series | Annales Universitatis Paedagogicae Cracoviensis: Studia Mathematica |
| spelling | doaj.art-0a427182585947b1a36fd6644eb6b1e02022-12-22T02:49:53ZdeuSciendoAnnales Universitatis Paedagogicae Cracoviensis: Studia Mathematica2081-545X2007-06-01615766Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problemSergey NovikovThere 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.http://studmath.up.krakow.pl/index.php/studmath/article/view/58 |
| spellingShingle | Sergey Novikov Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem Annales Universitatis Paedagogicae Cracoviensis: Studia Mathematica |
| title | Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem |
| title_full | Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem |
| title_fullStr | Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem |
| title_full_unstemmed | Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem |
| title_short | Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem |
| title_sort | upper estimates of complexity of algorithms for multi peg tower of hanoi problem |
| url | http://studmath.up.krakow.pl/index.php/studmath/article/view/58 |
| work_keys_str_mv | AT sergeynovikov upperestimatesofcomplexityofalgorithmsformultipegtowerofhanoiproblem |