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

MaRDI QIDQ5454908zbMATH OpenFDO

Authors S. P. Novikov

Publication date 3 April 2008

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The cyclic multi-peg Tower of Hanoi
• Towers of hanoi problem with arbitraryk≧3 pages
• On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
• scientific article; zbMATH DE number 1087226
• The complexity of an optimal algorithm for the generalized tower of hanoi problem

Cited in

(4)

• scientific article; zbMATH DE number 4007723 (Why is no real title available?)
• Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach
• Bounded Hanoi
• The complexity of the generalised cyclic Towers of Hanoi problem

This page was built for publication: Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5454908)