Comparison of two generalized methods for solving multi-peg towers of Hanoi puzzles

MaRDI QIDQ5441823zbMATH OpenFDO

Authors F. O. Ikpotokin, S. C. Chiemeke

Publication date 15 February 2008

zbMATH Keywords

dynamic programmingforward differencesgeneralized recursive algorithmMulti-peg tower of Hanoi puzzle

Mathematics Subject Classification ID

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

Recommendations

• Generalized multi-peg tower of hanoi problem
• scientific article; zbMATH DE number 5485303
• An Algorithmic Solution to the Multi-tower Hanoi Problem
• The generalized four-peg tower of hanoi problem
• On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem

Cited in

(2)

• On uniqueness of solution to the multi-peg towers of hanoi
• scientific article; zbMATH DE number 5485303 (Why is no real title available?)

This page was built for publication: Comparison of two generalized methods for solving multi-peg towers of Hanoi puzzles

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