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

zbMATH Open1190.05022MaRDI QIDQ5454908FDOQ5454908

Authors: S. P. Novikov 

Publication date: 3 April 2008

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

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• 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)