Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules

DOI10.1007/11940128_6zbMath1135.68437OpenAlexW1559164085MaRDI QIDQ5459100

Shay Solomon

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)

Related Items (1)

The tower of Hanoi problem on Path\(_h\) graphs

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