On uniqueness of solution to the multi-peg towers of hanoi

DOI10.1080/00207160108805096zbMath0983.05013OpenAlexW2028247306MaRDI QIDQ2752267

U. K. Sarkar

Publication date: 16 October 2001

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160108805096

zbMATH Keywords

dynamic programmingTowers of Hanoicombinatorial explosion

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Dynamic programming (90C39) Enumerative combinatorics (05A99)

Cites Work

• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• Recurrence relations based on minimization
• An iterative optimal algorithm for the generalized tower of hanoi problem
• Towers of hanoi problem with arbitraryk≧3 pages
• Improving Greedy Algorithms by Lookahead-Search
• A recursive algorithm for the multi-peg tower of hanoi problem

This page was built for publication: On uniqueness of solution to the multi-peg towers of hanoi