The generalizedppeg tower of hanoi problem

DOI10.1080/02331939508844045zbMATH Open0831.90119OpenAlexW1571867543MaRDI QIDQ4764584FDOQ4764584

Authors: A. A. K. Majumdar 

Publication date: 4 May 1995

Published in: Optimization (Search for Journal in Brave)

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

Recommendations

• The generalized four-peg tower of hanoi problem
• Generalized multi-peg tower of hanoi problem
• The Divide-and-Conquer Approach to the Generalizedp-Peg Tower of Hanoi Problem
• scientific article; zbMATH DE number 2168836

zbMATH Keywords

optimal policyoptimal partition numbersgeneralized \(p\)-peg Tower of Hanoi problem

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Dynamic programming (90C39)

Cites Work

• The generalized four-peg tower of hanoi problem

Cited In (17)

• Towers of hanoi problem with arbitraryk≧3 pages
• On uniqueness of solution to the multi-peg towers of hanoi
• Generalized sequencing problem “Towers of Hanoi”
• The Divide-and-Conquer Approach to the Generalizedp-Peg Tower of Hanoi Problem
• A new lower bound for the Towers of Hanoi problem
• Exact analysis of the recurrence relations generalized from the Tower of Hanoi
• On a recurrence relation related to the Reve's puzzle
• The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi)
• Title not available (Why is that?)
• Title not available (Why is that?)
• What is the least number of moves needed to solve the \(k\)-peg Tower of Hanoi problem?
• A note on the Frame-Stewart conjecture on the generalized Tower of Hanoi problem
• On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
• The generalized four-peg tower of hanoi problem
• The complexity of the generalised cyclic Towers of Hanoi problem
• The fourth tower of Hanoi
• Stockmeyer's tower

This page was built for publication: The generalized_ppeg tower of hanoi problem

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