The four-peg Tower of Hanoi puzzle

Variants of the classical Tower of Hanoi problem evolved in various directions. Allowing more than 3 pegs, and imposing limitations on the possible moves among the pegs, are two of these. Here, we deal with the case of h≥3 pegs arranged on a circle, ...

One of the variations of the Towers of Hanoi puzzle allows for p pegs, and for four pegs the solution to this variation is shown to have a simple structure which can be used to derive an iterative solution to the problem.

It is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all equivalent. Among them the classical approaches of Stewart and Frame from 1941 can be found.