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

Sergey Novikov

Abstract


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.

Mathematics Subject Classification


2000 Mathematics Subject Classification: 05-99

Full Text: PDF

Download statistics: 4202



e-ISSN: 2300-133X, ISSN: 2081-545X

Since 2017 Open Access in De Gruyter and CrossCheck access cofinanced by The Ministry of Science and Higher Education - Republic of Poland - DUN 775/P-DUN/2017 see more

The Journal is indexed in:
and others see Abstracting and Indexing list

AUPC SM is on the List of the Ministry’s scored journals with 20 points for 2019

Deklaracja dostępności cyfrowej