The Divide-and-Conquer Approach to the Generalizedp-Peg Tower of Hanoi Problem

DOI10.1080/02331939508844121zbMath0858.90134OpenAlexW1988150582MaRDI QIDQ4888283

A. A. K. Majumdar

Publication date: 28 July 1996

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

optimal policydivide-and-conquer approachgeneralized \(p\)-peg tower of Hanoi problemoptimal partition numberspresumed minimum solution

Mathematics Subject Classification ID

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

Cites Work

• An iterative algorithm for the Tower of Hanoi with four pegs
• The generalized four-peg tower of hanoi problem
• The generalized_ppeg tower of hanoi problem

This page was built for publication: The Divide-and-Conquer Approach to the Generalizedp-Peg Tower of Hanoi Problem