On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi 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. Key words: Multi-peg Tower of Hanoi problem, Frame-Stewart algorithm, recursion, dynamic programming

• Type: Journal
• Year: 2002
• Where: DAM
• Authors: Sandi Klavzar, Uros Milutinovic, Ciril Petr
• Keywords: Classical Approaches, DAM 2002, Hanoi Problem, Multi-peg Tower