Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem
| dc.contributor.author | Novikov, Sergey | pl_PL |
| dc.date.accessioned | 2020-02-17T09:14:50Z | |
| dc.date.available | 2020-02-17T09:14:50Z | |
| dc.date.issued | 2007 | |
| dc.identifier.citation | Annales Academiae Paedagogicae Cracoviensis. 45, Studia Mathematica 6 (2007), s. [57]-66 | pl_PL |
| dc.identifier.uri | http://hdl.handle.net/11716/6838 | |
| dc.description.abstract | 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. | en_EN |
| dc.language.iso | en | pl_PL |
| dc.title | Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem | en_EN |
| dc.type | Article | pl_PL |