Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules

DOI10.1007/11940128_6MaRDI QIDQ5459100zbMATH OpenOpenAlexFDO

Authors Shay Solomon, Yefim Dinitz

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
• Optimality of an algorithm solving the bottleneck Tower of Hanoi problem
• scientific article; zbMATH DE number 1439478
• The Tower of Hanoi with Forbidden Moves
• The complexity of an optimal algorithm for the generalized tower of hanoi problem

Cited in

(3)

• The tower of Hanoi problem on Path\(_h\) graphs
• On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
• Optimality of an algorithm solving the bottleneck Tower of Hanoi problem

This page was built for publication: Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules

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