On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem

DOI10.1016/S0304-3975(00)00020-7zbMath0939.68164MaRDI QIDQ1566738

U. K. Sarkar

Publication date: 4 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingcombinatorial problemtowers of Hanoirecursive formulationcombinatorial explosiondesign of algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• Recurrence relations based on minimization
• Improving Greedy Algorithms by Lookahead-Search

This page was built for publication: On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem